The Ramsey theory of the universal homogeneous triangle-free graph

The universal homogeneous triangle-free graph, constructed by Henson and denoted $\mathcal{H}_3$, is the triangle-free analogue of the Rado graph. While the Ramsey theory of the Rado graph has been completely established, beginning with Erdős-Hajnal-Posa and culminating in work of Sauer and Laflamme-Sauer-Vuksanovic, the Ramsey theory of $\mathcal{H}_3$ had only progressed to bounds for vertex colorings (Komjath-Rodl) and edge colorings (Sauer). This was due to a lack of broadscale techniques. We solve this problem in general: For each finite triangle-free graph $G$, there is a finite number $T(G)$ such that for any coloring of all copies of $G$ in $\mathcal{H}_3$ into finitely many colors, there is a subgraph of $\mathcal{H}_3$ which is again universal homogeneous triangle-free in which the coloring takes no more than $T(G)$ colors. This is the first such result for a homogeneous structure omitting copies of some non-trivial finite structure. The proof entails developments of new broadscale techniques, including a flexible method for constructing trees which code $\mathcal{H}_3$ and the development of their Ramsey theory.

[1]  Vaught,et al.  A family of countable homogeneous graphs , 1971 .

[2]  Vojtech Rödl,et al.  Partitions of Finite Relational and Set Systems , 1977, J. Comb. Theory A.

[3]  Maurice Pouzet,et al.  Edge partitions of the Rado graph , 1996, Comb..

[4]  Norbert Sauer.  COLORING SUBGRAPHS OF THE RADO GRAPH , 2006, Comb..

[5]  Natasha Dobrinen.  Forcing in Ramsey theory , 2017 .

[6]  Keegan Dasilva Barbosa.  A Categorical Notion of Precompact Expansion , 2020 .

[7]  Stevo Todorcevic,et al.  Introduction to Ramsey Spaces , 2010 .

[8]  Richard Laver,et al.  Products of Infinitely Many Perfect Trees , 1984 .

[9]  Dimitris Vlitas.  A canonical partition theorem for uniform families of finite strong subtrees , 2014, Discret. Math..

[10]  Vojkan Vuksanovic,et al.  Canonical Partitions Of Universal Structures , 2006, Comb..

[11]  P. Erdös,et al.  A Partition Calculus in Set Theory , 1956 .

[12]  Andy Zucker.  Big Ramsey degrees and topological dynamics , 2018, Groups, Geometry, and Dynamics.

[13]  Natasha Dobrinen.  The Ramsey Theory of Henson graphs , 2019 .

[14]  Stevo Todorcevic,et al.  Introduction to Ramsey Spaces (AM-174) , 2010 .

[15]  William J. Mitchell,et al.  Partitions of large Rado graphs , 2009, Arch. Math. Log..

[16]  Natasha Dobrinen.  Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees , 2019, 1909.05985.

[17]  Leo Harrington,et al.  Models Without Indiscernibles , 1978, J. Symb. Log..

[18]  Keith R. Milliken,et al.  A partition theorem for the infinite subtrees of a tree , 1981 .

[19]  Jean A. Larson.  Counting canonical partitions in the random graph , 2008, Comb..

[20]  L. Nguyen.  Big Ramsey degrees and divisibility in classes of ultrametric spaces , 2007 .

[21]  Combinatorics Springer-Verlag.  Coloring of Universal Graphs , 1986 .

[22]  Natasha Dobrinen,et al.  The Halpern-läUchli Theorem at a Measurable cardinal , 2017, J. Symb. Log..

[23]  Jing Zhang.  A Tail cone Version of the Halpern-läUchli Theorem at a Large cardinal , 2019, J. Symb. Log..

[24]  Dragan Masulovic.  Finite big Ramsey degrees in universal structures , 2020, J. Comb. Theory, Ser. A.

[25]  V. Pestov,et al.  Fraïssé Limits, Ramsey Theory, and topological dynamics of automorphism groups , 2003 .

[26]  R L Graham,et al.  Ramsey's Theorem for a Class of Categories. , 1972, Proceedings of the National Academy of Sciences of the United States of America.

[27]  Vojtech Rödl,et al.  Ramsey Classes of Set Systems , 1983, J. Comb. Theory, Ser. A.

[28]  Norbert Sauer.  Edge partitions of the countable triangle free homogeneous graph , 1998, Discret. Math..

[29]  J. Folkman.  Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring , 1970 .

[30]  R. Graham,et al.  Ramsey’s theorem for $n$-parameter sets , 1971 .

[31]  J. D. Halpern,et al.  A partition theorem , 1966 .

[32]  Norbert Sauer,et al.  The indivisibility of the homogeneous Kn-free graphs , 1989, J. Comb. Theory, Ser. B.

[33]  Saharon Shelah.  Strong Partition Realations Below the Power Set: Consistency Was Sierpinski Right? II. , 1991 .

[34]  Andy Zucker.  A note on big Ramsey degrees , 2020 .

[35]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[36]  L. Nguyen Van Th'e.  Big Ramsey degrees and divisibility in classes of ultrametric spaces , 2007 .

[37]  Claude Laflamme,et al.  Partition properties of the dense local order and a colored version of Milliken’s theorem , 2010, Comb..

[38]  Keith R. Milliken,et al.  A Ramsey Theorem for Trees , 1979, J. Comb. Theory, Ser. A.