Related papers: Ramsey Classes with Closure Operations (Selected C…
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…
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…
In this paper we provide explicit dual Ramsey statements for several classes of finite relational structures (such as finite linearly ordered graphs, finite linearly ordered metric spaces and finite posets with a linear extension) and…
This article is concerned with classes of relational structures that are closed under taking substructures and isomorphism, that have the joint embedding property, and that furthermore have the Ramsey property, a strong combinatorial…
In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
In the parlance of relational structures, the Finite Ramsey Theorem states that the class of all finite chains has the Ramsey property. A classical result of J. Ne\v{s}et\v{r}il and V. R\"{o}dl claims that the class of all finite posets…
Showing that the Ramsey property holds for a class of finite structures can be an extremely challenging task and a slew of sophisticated methods have been proposed in literature. In this paper we propose a new strategy to show that a class…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
The celebrated theorem of Kechris, Pestov and Todor\v{c}evi\'c connecting structural Ramsey theory with topological dynamics has as a consequence that the Fra\"{\i}ss\'e limit of a Ramsey class of non-trivial finite relational structures…
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
At the beginning of 1950's Erd\H os and Rado suggested the investigation of the Ramsey-type results where the number of colors is not finite. This marked the birth of the so-called canonizing Ramsey theory. In 1985 Pr\"omel and Voigt made…
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…
In this paper we give a new proof of the Ne\v{s}et\v{r}il-R\"odl Theorem, a deep result of discrete mathematics which is one of the cornerstones of the structural Ramsey theory. In contrast to the well-known proofs which employ intricate…
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…
In this paper we provide purely categorical proofs of two important results of structural Ramsey theory: the result of M.\ Soki\'c that the free product of Ramsey classes is a Ramsey class and the result of M.\ Bodirsky, M.\Pinsker and T.\…
It has become obvious in the recent development that the structural Ramsey property is a categorical property: it depends not only on the choice of objects, but also on the choice of morphisms involved. In this paper we explicitely put the…
The class of finite distributive lattices, as many other classes of structures, does not have the Ramsey property. It is quite common, though, that after expanding the structures with appropriately chosen linear orders the resulting class…
We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.
Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…