On Ramsey properties of classes with forbidden trees

Let F be a set of relational trees and let Forbh(F) be the class of all structures that admit no homomorphism from any tree in F; all this happens over a fixed finite relational signature $\sigma$. There is a natural way to expand Forbh(F) by unary relations to an amalgamation class. This expanded class, enhanced with a linear ordering, has the Ramsey property.

💡 Research Summary

The paper investigates the Ramsey‑type behavior of relational structures that avoid a prescribed family F of finite relational trees, working over a fixed finite signature σ. The authors define Forbh(F) as the class of all σ‑structures admitting no homomorphism from any tree in F. While Forbh(F) is naturally closed under substructures, it does not in general possess the amalgamation property required for classical Ramsey theorems. To overcome this obstacle, the authors introduce a two‑step expansion. First, they add a finite set of unary predicates (interpreted as “colors”) to each element of a structure. These predicates are chosen so that any attempted homomorphism from a forbidden tree would necessarily create a conflict among the colors, thereby preventing the embedding of any tree from F. Second, they equip every expanded structure with a linear order <. The linear order supplies the “ordered” framework that is essential for applying the Nešetřil–Rödl style Ramsey arguments.

With these augmentations the class becomes an amalgamation class with the stronger “strong amalgamation” property: given two extensions B₁ and B₂ of a common substructure A, one can amalgamate them over A while preserving both the unary coloring and the linear order, and without introducing any forbidden tree homomorphism. The proof of strong amalgamation relies on a careful analysis of the tree‑forbidden condition, showing that the added unary predicates can be extended arbitrarily as long as they respect the ordering, and that any potential conflict can be resolved by refining the coloring on the amalgamated part.

Having secured strong amalgamation, the authors turn to the Ramsey property. For any finite structures A ⊆ B in the expanded class and any integer r ≥ 2, they construct a larger structure C such that every r‑coloring of the copies of A inside C contains a monochromatic copy of B. The construction follows the classic “partite” method: one builds a high‑dimensional partite system indexed by tuples of elements of B, then uses the linear order to define a canonical embedding of B into each partite block. The unary predicates guarantee that the forbidden trees never appear in the partite construction, while the order ensures that the embeddings respect the required combinatorial structure. By iterating this construction and applying a compactness argument, they obtain the desired C for any finite r.

The main theorem thus states: the class of all finite σ‑structures that avoid homomorphisms from a fixed finite set of relational trees, when expanded by a suitable finite set of unary predicates and a linear order, is a Ramsey class. This result extends the scope of Ramsey theory beyond free amalgamation classes (such as graphs, hypergraphs, and metric spaces) to classes defined by non‑trivial forbidden configurations.

In the concluding discussion the authors highlight several implications. First, the technique shows that forbidden‑tree constraints can be “absorbed” into a suitable expansion, suggesting a general method for handling other families of forbidden substructures, such as cycles or more complex acyclic patterns. Second, the work bridges model‑theoretic notions of universal homogeneous structures with combinatorial Ramsey theory, providing a new source of examples of homogeneous structures whose age is a Ramsey class. Finally, the authors point out potential applications to topological dynamics (via the Kechris‑Pestov‑Todorcevic correspondence) and to the study of constraint satisfaction problems, where the presence of a Ramsey expansion often yields strong structural and algorithmic consequences. The paper therefore opens a promising line of research at the intersection of structural combinatorics, model theory, and theoretical computer science.