Search

We prove oscillation stability for the Banach space $\ell_\infty$: every weak-* Borel, uniformily continuous map from the unit sphere of this space to a compact metric space can be made arbitrarily close to a constant map when restricted to the unit sphere of a suitable linear isometric subcopy of $\ell_\infty$. We also give a new proof of oscillation stability for the Urysohn sphere (a result by Nguyen Van Th\'e--Sauer): every uniformily continuous map from the Urysohn sphere to a compact metric space can be made arbitrarily close to a constant map when restricted to a suitable isometric subcopy of the Urysohn sphere. Both proofs are based on Carlson-Simpson's dual Ramsey theorem., Comment: 14 pages

In the 1970s, structural Ramsey theory emerged as a new branch of combinatorics. This development came with the isolation of the concepts of the $\mathbf{A}$-Ramsey property and Ramsey class. Following the influential Ne\v{s}et\v{r}il-R\"{o}dl theorem, several Ramsey classes have been identified. In the 1980s Ne\v{s}et\v{r}il, inspired by a seminar of Lachlan, discovered a crucial connection between Ramsey classes and Fra\"{\i}ss\'{e} classes and, in his 1989 paper, connected the classification programme of homogeneous structures to structural Ramsey theory. In 2005, Kechris, Pestov, and Todor\v{c}evi\'{c} revitalized the field by connecting Ramsey classes to topological dynamics. This breakthrough motivated Ne\v{s}et\v{r}il to propose a program for classifying Ramsey classes. We review the progress made on this program in the past two decades, list open problems, and discuss recent extensions to new areas, namely the extension property for partial automorphisms (EPPA), and big Ramsey structures.

Dufaycolor, an additive color photography process produced from 1935 to the late 1950s, represents one of the most advanced iterations of this technique. This paper presents ongoing research and development of an open-source Color-Screen tool designed to reconstruct the original colors of additive color photographs. We discuss the incorporation of historical measurements of dyes used in the production of the color-screen filter (r\'eseau) to achieve accurate color recovery., Comment: 8 pages, 6 figures, 4 tables; submitted to proceedings of 3rd international conference on "Colour Photography and Film: analysis, preservation, and conservation of analogue and digital materials"

In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single expansion of the structure, called a big Ramsey structure, which correctly encodes the exact big Ramsey degrees of every finite substructure simultaneously. The first half of the article collects facts about this phenomenon that have appeared in the literature into a single cohesive framework, thus offering a conceptual survey of big Ramsey structures. We present some original results indicating that the standard methods of proving finite big Ramsey degrees automatically yield big Ramsey structures, often with desirable extra properties. The second half of the article is a survey in the more traditional sense, discussing numerous examples from the literature and showing how they fit into our framework. We also present some general results on how big Ramsey degrees are affected by expanding structures with unary functions.

We present a proof of the extension property for partial automorphisms (EPPA) for classes of finite $n$-partite tournaments for $n \in \{2,3,\ldots,\omega\}$, and for the class of finite semigeneric tournaments. We also prove that the generic $\omega$-partite tournament and the generic semigeneric tournament have ample generics., Comment: Revision mainly improves the presentation of the construction in Section 5

If $G$ is a graph, $A$ and $B$ its induced subgraphs, and $f\colon A\to B$ an isomorphism, we say that $f$ is a \emph{partial automorphism} of $G$. In 1992, Hrushovski proved that graphs have the \emph{extension property for partial automorphisms} (\emph{EPPA}, also called the \emph{Hrushovski property}), that is, for every finite graph $G$ there is a finite graph $H$, an \emph{EPPA-witness} for $G$, such that $G$ is an induced subgraph of $H$ and every partial automorphism of $G$ extends to an automorphism of $H$. The EPPA number of a graph $G$, denoted by $\mathop{\mathrm{eppa}}\nolimits(G)$, is the smallest number of vertices of an EPPA-witness for $G$, and we put $\mathop{\mathrm{eppa}}\nolimits(n) = \max\{\mathop{\mathrm{eppa}}\nolimits(G) : \lvert G\rvert = n\}$. In this note we review the state of the area, prove several lower bounds (in particular, we show that $\mathop{\mathrm{eppa}}\nolimits(n)\geq \frac{2^n}{\sqrt{n}}$, thereby identifying the correct base of the exponential) and pose many open questions. We also briefly discuss EPPA numbers of hypergraphs, directed graphs, and $K_k$-free graphs., Comment: Minor revision

We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees. Our theorem has a number of applications both in finite and infinite combinatorics. For example, we give a short proof of the unrestricted Ne\v{s}et\v{r}il-R\"odl theorem, and we recover the Graham-Rothschild theorem. Our original motivation came from the study of big Ramsey degrees - various trees used in the study can be viewed as trees with a successor operation. To illustrate this, we give a non-forcing proof of a theorem of Zucker on big Ramsey degrees., Comment: 37 pages, 9 figures

Some early color photographic processes based on special color screen filters pose specific challenges in their digitization and digital presentation. Those challenges include dynamic range, resolution, and the difficulty of stitching geometrically-repeating patterns. We describe a novel method used to digitize the collection of early color photographs at the National Geographic Society which makes use of a custom open-source software tool to analyze and precisely stitch regular color screen processes., Comment: 8 pages, 4 figures, submitted to the proceedings of XVIII Color Conference

Oscillation stability is an important concept in Banach space theory which happens to be closely connected to discrete Ramsey theory. For example, Gowers proved oscillation stability for the Banach space $c_0$ using his now famous Ramsey theorem for $\mathrm{FIN}_k$ as the key ingredient. We develop the theory behind this connection and introduce the notion of compact big Ramsey degrees, extending the theory of (discrete) big Ramsey degrees. We then prove existence of compact big Ramsey degrees for the Banach space $\ell_\infty$ and the Urysohn sphere, with an explicit characterization in the case of $\ell_\infty$., Comment: 6 pages; extended abstract

We give an infinitary extension of the Ne\v{s}et\v{r}il-R\"{o}dl theorem for category of relational structures with special type-respecting embeddings., Comment: 5 pages. Extended abstract

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey class (this result was announced by Ne\v{s}et\v{r}il and R\"odl in 1984 with first published proof by Paoli, Trotter and Walker in 1985). Towards this, we refine earlier upper bounds obtained by Hubi\v{c}ka based on a new connection of big Ramsey degrees to the Carlson-Simpson theorem and we also introduce a new technique of giving lower bounds using an iterated application of the upper-bound theorem., Comment: 30 pages, 7 figures. Minor revision incorporating suggestions of the second anonymous referee

This paper investigates big Ramsey degrees of unrestricted relational structures in (possibly) infinite languages. Despite significant progress in the study of big Ramsey degrees, the big Ramsey degrees of many classes of structures with finite small Ramsey degrees are still not well understood. We show that if there are only finitely many relations of every arity greater than one, then unrestricted relational structures have finite big Ramsey degrees, and give some evidence that this is tight. This is the first time finiteness of big Ramsey degrees has been established for a random structure in an infinite language. Our results represent an important step towards a better understanding of big Ramsey degrees for structures with relations of arity greater than two., Comment: 26 pages

We discuss digitization, subsequent digital analysis and processing of negatives (and diapositives) made by Finlay, Thames, Dufay, Paget, and similar additive color screen processes. These early color processes (introduced in the 1890s and popular until the 1950s) used a special color screen filter and a monochromatic negative. Due to poor stability of dyes used to produce color screens many of the photographs appear faded; others exist only in the form of (monochromatic) negatives. We discuss the possibility of digitally reconstructing the original color from scans of original negatives or by virtue of infrared imaging of original transparencies (which eliminates the physically coupled color filters) and digitally recreating the original color filter pattern using a new open-source software tool. Photographs taken using additive color screen processes are some of the very earliest color images of our shared cultural heritage. They depict people, places, and events for which there are no other surviving color images. We hope that our new software tool can bring these images back to life., Comment: 8 figures, 9 pages; submitted to the proceedings of Colour Photography and Film: sharing knowledge of analysis, preservation, conservation, migration of analogue and digital materials

A partial order is universal if it contains every countable partial order as a suborder. In 2017, Fiala, Hubi\v{c}ka, Long and Ne\v{s}et\v{r}il showed that every interval in the homomorphism order of graphs is universal, with the only exception being the trivial gap $[K_1,K_2]$. We consider the homomorphism order restricted to the class of oriented paths and trees. We show that every interval between two oriented paths or oriented trees of height at least 4 is universal. The exceptional intervals coincide for oriented paths and trees and are contained in the class of oriented paths of height at most 3, which forms a chain., Comment: 6 pages, 1 figure. Extended abstract for Eurocomb 2021; corrected title

We characterize the big Ramsey degrees of free amalgamation classes in finite binary languages defined by finitely many forbidden irreducible substructures, thus refining the recent upper bounds given by Zucker. Using this characterization, we show that the Fra\"iss\'e limit of each such class admits a strong big Ramsey structure, implying that the automorphism group of the Fra\"iss\'e limit has a metrizable universal completion flow., Comment: Revised version; formerly titled "Exact big Ramsey degrees via coding trees."

We study Ramsey expansions of certain homogeneous 3-hypertournaments. We show that they exhibit an interesting behaviour and, in one case, they seem not to submit to current gold-standard methods for obtaining Ramsey expansions. This makes these examples very interesting from the point of view of structural Ramsey theory as there is a large demand for novel examples., Comment: Extended abstract accepted to EUROCOMB 2021

Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees, Comment: 6 pages, extended abstract accepted to EUROCOMB 2021

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order in a similar way as Devlin characterised big Ramsey degrees of the generic linear order (the order of rationals)., Comment: 6 pages, extended abstract accepted to EUROCOMB 2021

We survey recent developments concerning two properties of classes of finite structures: the Ramsey property and the extension property for partial automorphisms (EPPA)., Comment: 31 pages, 5 figures; written as introduction chapter for habilitation thesis

We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the Halpern-L\"auchli theorem and the Milliken tree theorem, which are typically used to bound big Ramsey degrees in the existing literature (originating from the work of Laver and Milliken). This new technique has many additional applications. We show that the homogeneous universal triangle-free graph has finite big Ramsey degrees, providing a short proof of a recent result by Dobrinen. Moreover, generalizing an indivisibility (vertex partition) result of Nguyen van Th\'e and Sauer, we give an upper bound on big Ramsey degrees of metric spaces with finitely many distances. This leads to a new combinatorial argument for the oscillation stability of the Urysohn Sphere., Comment: 33 pages, 2 figures; minor revision incorporating comments of the anonymous referee and reformated to journal's template

We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or product) form of Milliken's Tree Theorem and demonstrates a general method to carry existing results on structures in binary relational languages to higher arities., Comment: 10 pages, 2 figures. Minor corrections and presentation improvements suggested by the referees

Tent and Ziegler proved that the automorphism group of the Urysohn sphere is simple and that the automorphism group of the Urysohn space is simple modulo bounded automorphisms. A key component of their proof is the definition of a stationary independence relation (SIR). In this paper we prove that the existence of a SIR satisfying some extra axioms is enough to prove simplicity of the automorphism group of a countable structure. The extra axioms are chosen with applications in mind, namely homogeneous structures which admit a "metric-like amalgamation", for example all primitive 3-constrained metrically homogeneous graphs of finite diameter from Cherlin's list., Comment: Accepted to Journal of Algebra

Given a countably infinite hypergraph $\mathcal R$ and a finite hypergraph $\mathcal A$, the big Ramsey degree of $\mathcal A$ in $\mathcal R$ is the least number $L$ such that, for every finite $k$ and every $k$-colouring of the embeddings of $\mathcal A$ to $\mathcal R$, there exists an embedding $f$ from $\mathcal R$ to $\mathcal R$ such that all the embeddings of $\mathcal A$ to the image $f(\mathcal R)$ have at most $L$ different colours. We describe the big Ramsey degrees of the random countably infinite 3-uniform hypergraph, thereby solving a question of Sauer. We also give a new presentation of the results of Devlin and Sauer on, respectively, big Ramsey degrees of the order of the rationals and the countably infinite random graph. Our techniques generalise (in a natural way) to relational structures and give new examples of Ramsey structures (a concept recently introduced by Zucker with applications to topological dynamics)., Comment: 8 pages, 3 figures, extended abstract for Eurocomb 2019

We show the density theorem for the class of finite oriented trees ordered by the homomorphism order. We also show that every interval of oriented trees, in addition to be dense, is in fact universal. We end by considering the fractal property in the class of all finite digraphs., Comment: 5 pages, 4 figures. Extended abstract for Eurocomb 2019. Minor revision

We prove that for every $n\geq 2$ the class of all finite $n$-partite tournaments (orientations of complete $n$-partite graphs) has the extension property for partial automorphisms, that is, for every finite $n$-partite tournament $G$ there is a finite $n$-partite tournament $H$ such that every isomorphism of induced subgraphs of $G$ extends to an automorphism of $H$. Our constructions are purely combinatorial (whereas many earlier EPPA results use deep results from group theory) and extend to other classes such as the class of all finite semi-generic tournaments., Comment: 5 pages, extended abstract

In this paper we prove a general theorem showing the extension property for partial automorphisms (EPPA, also called the Hrushovski property) for classes of structures containing relations and unary functions, optionally equipped with a permutation group of the language. The proof is elementary, combinatorial and fully self-contained. Our result is a common strengthening of the Herwig-Lascar theorem on EPPA for relational classes with forbidden homomorphisms, the Hodkinson-Otto theorem on EPPA for relational free amalgamation classes, its strengthening for unary functions by Evans, Hubi\v{c}ka and Ne\v{s}et\v{r}il and their coherent variants by Siniora and Solecki. We also prove an EPPA analogue of the main results of J. Hubi\v{c}ka and J. Ne\v{s}et\v{r}il: All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms), thereby establishing a common framework for proving EPPA and the Ramsey property. Our results have numerous applications, we include a solution of a problem related to a class constructed by the Hrushovski predimension construction., Comment: 63 pages, 3 figures. Minor revision addressing comments of the referee

We prove that the class of finite two-graphs has the extension property for partial automorphisms (EPPA, or Hrushovski property), thereby answering a question of Macpherson. In other words, we show that the class of graphs has the extension property for switching automorphisms. We present a short, self-contained, purely combinatorial proof which also proves EPPA for the class of integer valued antipodal metric spaces of diameter 3, answering a question of Aranda et al. The class of two-graphs is an important new example which behaves differently from all the other known classes with EPPA: Two-graphs do not have the amalgamation property with automorphisms (APA), their Ramsey expansion has to add a graph, it is not known if they have coherent EPPA and even EPPA itself cannot be proved using the Herwig--Lascar theorem., Comment: 14 pages, 3 figures

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal F$ of $\{1,\ldots, \delta\}$-edge-labelled cycles such that a $\{1,\ldots, \delta\}$-edge-labelled graph is a subgraph of $\Gamma$ if and only if it contains no homomorphic images of cycles from $\mathcal F$. However, the cycles in the families $\mathcal F$ were not described explicitly as it was not necessary for the analysis of Ramsey expansions and the extension property for partial automorphisms. This paper fills this gap by providing an explicit description of the cycles in the families $\mathcal F$, heavily using the previous result in the process. Additionally, we explore the potential applications of this result, such as interpreting the graphs as semigroup-valued metric spaces or homogenizations of $\omega$-categorical $\{1,\delta\}$-edge-labelled graphs., Comment: 25 pages. Minor revisions, accepted to European Journal of Combinatorics

We present a short and self-contained proof of the extension property for partial isometries of the class of all finite metric spaces., Comment: 7 pages, 1 figure. Minor revision. Accepted to Commentationes Mathematicae Universitatis Carolinae

We study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todor\v{c}evi\'c correspondence. We investigate amenable and extremely amenable subgroups of these groups using the space of orientations of the graph and results from structural Ramsey theory. Resolving one of the open questions in the area, we show that Hrushovski's example of an $\omega$-categorical sparse graph has no $\omega$-categorical expansion with extremely amenable automorphism group., Comment: 41 pages, 2 figures, minor revision

We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an earlier result of the first and the last author giving the Ramsey property of convexly ordered $S$-metric spaces. Unlike Conant's approach, our analysis does not require the monoid to be semi-archimedean., Comment: 25 pages, 4 figures. Corrected proof of Lemma 6.20. Accepted to Contributions to Discrete Mathematics

We investigate Ramsey expansions, the coherent extension property for partial isometries (EPPA), and the existence of a stationary independence relation for all classes of metrically homogeneous graphs from Cherlin's catalogue. We show that, with the exception of tree-like graphs, all metric spaces in the catalogue have precompact Ramsey expansions (or lifts) with the expansion property. With two exceptions we can also characterise the existence of a stationary independence relation and coherent EPPA. Our results are a contribution to Ne\v{s}et\v{r}il's classification programme of Ramsey classes and can be seen as empirical evidence of the recent convergence in techniques employed to establish the Ramsey property, the expansion property, EPPA and the existence of a stationary independence relation. At the heart of our proof is a canonical way of completing edge-labelled graphs to metric spaces in Cherlin's classes. The existence of such a ``completion algorithm'' then allows us to apply several strong results in the areas that imply EPPA or the Ramsey property. The main results have numerous consequences for the automorphism groups of the Fraisse limits of the classes. As corollaries, we prove amenability, unique ergodicity, existence of universal minimal flows, ample generics, small index property, 21-Bergman property and Serre's property (FA)., Comment: 59 pages, 14 figures. Minor revision, added "symmetric" qualifier to canonical amalgamation operator

We prove that certain classes of metrically homogeneous graphs omitting triangles of odd short perimeter as well as triangles of long perimeter have the extension property for partial automorphisms and we describe their Ramsey expansions., Comment: 19 pages, 7 figures; to appear in Contributions to Discrete Mathematics

We prove that for any choice of parameters $k,t,\lambda$ the class of all finite ordered designs with parameters $k,t,\lambda$ is a Ramsey class., Comment: 8 pages, extended abstract for Eurocomb 2017

We characterise gaps in the full homomorphism order of graphs., Comment: 9 pages, extended abstract for Eurocomb 2017

We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Ne\v{s}et\v{r}il-R\"odl Theorem and the second and third authors' Ramsey theorem for finite models (that is, structures with both relations and functions). We also find subclasses with the ordering property. For languages with relational symbols and unary functions we also show the extension property for partial automorphisms (EPPA) of free amalgamation classes. These general results solve several conjectures and provide an easy Ramseyness test for many classes of structures., Comment: 30 pages, 9 figures; corrections and presentation improvements suggested by the referee. Functions in structures are now set-valued

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well as the Ramsey Theorem for Finite Models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of Structural Ramsey Theorem. We give here a more concise reformulation of recent authors paper "All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)" and the main purpose of this paper is to show several applications. Particularly we prove the Ramsey property of ordered sets with equivalences on the power set, Ramsey theorem for Steiner systems, Ramsey theorem for resolvable designs and a partial Ramsey type results for $H$-factorizable graphs. All of these results are natural, easy to state, yet proofs involve most of the theory developed., Comment: 16 pages, 2 figures. Minor correction according to referees comments. arXiv admin note: text overlap with arXiv:1606.07979. Author note: main theorem of arXiv:1606.07979 is used here

We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism order. We first show the fractal property by using Sparse Incomparability Lemma and then by more involved elementary argument., Comment: 8 pages, 5 figures. Minor corrections and reformatting. Accepted to European Journal of Combinatorics

We prove the Ramsey property for classes of ordered structures with closures and given local properties. This generalises earlier results: the Ne\v{s}et\v{r}il-R\"odl Theorem, the Ramsey property of partial orders and metric spaces as well as the authors' Ramsey lift of bowtie-free graphs. We use this framework to solve several open problems and give new examples of Ramsey classes. Among others, we find Ramsey lifts of convexly ordered $S$-metric spaces and prove the Ramsey theorem for finite models (i.e. structures with both functions and relations) thus providing the ultimate generalisation of the structural Ramsey theorem. Both of these results are natural, and easy to state, yet their proofs involve most of the theory developed here. We also characterise Ramsey lifts of classes of structures defined by finitely many forbidden homomorphisms and extend this to special cases of classes with closures. This has numerous applications. For example, we find Ramsey lifts of many Cherlin-Shelah-Shi classes., Comment: 91 pages, 21 figures. Accepted to Advances in Mathematics. Reformatted to match journal recommendations. Changed numbering of Theorems. Theorem 2.1 in the previous draft is now Theorem 2.11. Theorem 2.2 in the previous draft is now Theorem 2.18

We prove that for every $d\geq 3$ the homomorphism order of the class of line graphs of finite graphs with maximal degree $d$ is universal. This means that every finite or countably infinite partially ordered set may be represented by line graphs of graphs with maximal degree $d$ ordered by the existence of a homomorphism., Comment: 13 pages, 8 figures, accepted to European Journal of Combinatorics

A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph has a Ramsey lift (expansion). This solves one of the old problems in the area and it is the first non-trivial Ramsey class with a non-trivial algebraic closure., Comment: 32 pages, 5 figures. Minor corrections; reformatted to elsarticle; accepted to Advances in Applied Mathematics

The relational complexity, introduced by G. Cherlin, G. Martin, and D. Saracino, is a measure of ultrahomogeneity of a relational structure. It provides an information on minimal arity of additional invariant relations needed to turn given structure into an ultrahomogeneous one. The original motivation was group theory. This work focuses more on structures and provides an alternative approach. Our study is motivated by related concept of lift complexity studied by Hubicka and Nesetril., Comment: 18 pages, submitted to Mathematica Slovaca

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective homomorphisms of graphs and naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs. Both R-cores and R-cocores of graphs are unique up to isomorphism and can be computed in polynomial time., Comment: accepted by Ars Mathematica Contemporanea

A relational structure is homomorphism-homogeneous (HH-homogeneous for short) if every homomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. Similarly, a structure is monomorphism-homogeneous (MH-homogeneous for short) if every monomorphism between finite induced substructures of the structure can be extended to a homomorphism over the whole domain of the structure. In this paper we consider L-colored graphs, that is, undirected graphs without loops where sets of colors selected from L are assigned to vertices and edges. A full classification of finite MH-homogeneous L-colored graphs where L is a chain is provided, and we show that the classes MH and HH coincide. When L is a diamond, that is, a set of pairwise incomparable elements enriched with a greatest and a least element, the situation turns out to be much more involved. We show that in the general case the classes MH and HH do not coincide., Comment: Submitted to European Journal of Combinatorics

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite presentation). Extending classical work of Rado (for the random graph), we find a finite presentation for each of the following classes: homogeneous undirected graphs, homogeneous tournaments and homogeneous partially ordered sets. We also give a finite presentation of the rational Urysohn metric space and some homogeneous directed graphs. We survey well known structures that are finitely presented. We focus on structures endowed with natural partial orders and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism orders for various combinatorial objects. We give a new combinatorial proof of the existence of embedding-universal objects for homomorphism-defined classes of structures. This relates countable embedding-universal structures to homomorphism dualities (finite homomorphism-universal structures) and Urysohn metric spaces. Our explicit construction also allows us to show several properties of these structures., Comment: PhD thesis, unofficial version (missing apple font)

We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order for various combinatorial objects., Comment: 31 pages, 5 figures. Updated version with many grammar fixes and also few minor corrections in proof in Section 3. Accepted for Model theoretic methods in finite Combinatorics

This paper unifies problems and results related to (embedding) universal and homomorphism universal structures. On the one side we give a new combinatorial proof of the existence of universal objects for homomorphism defined classes of structures (thus reproving a result of Cherlin, Shelah and Shi) and on the other side this leads to the new proof of the existence of dual objects (established by Ne\v{s}et\v{r}il and Tardif). Our explicite approach has further applications to special structures such as variants of the rational Urysohn space. We also solve a related extremal problem which shows the optimality (of the used lifted arities) of our construction (and a related problem of A. Atserias)., Comment: 27 pages, 4 figures. Reworked version to appear in Journal of Multiple-Valued Logic and Soft Computing

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite connected structures there exists a (countable) \omega-categorical universal structure U for the class Forb(F) (of all countable structures not containing any homomorphic image of a member of F). We employ a technique known as homogenization: The universal object U is the shadow (reduct) of an ultrahomogeneous structure U'. We also put the results of this paper in the context of homomorphism dualities and constraint satisfaction problems. This leads to an alternative proof of the characterization of finite dualities (given by Tardif and Ne\v{s}et\v{r}il) as well as of the characterization of infinite-finite dualities for classes of relational trees given by P. L. Erd\H{o}s, P\'{a}lv\"{o}lgyi, Tardif and Tardos. The notion of regular families of structures is motivated by the recent characterization of infinite-finite dualities for classes of relational forests (itself related to regular languages). We show how the notion of a regular family of relational trees can be extended to regular families of relational structures. This gives a partial characterization of the existence of a (countable) \omega-categorical universal object for classes Forb(F)., Comment: 26 pages, 6 figures. Language corrections, version as accepted for publication