A Ramsey class for Steiner systems

Abstract We construct a Ramsey class whose objects are Steiner systems. In contrast to the situation with general r -uniform hypergraphs, it turns out that simply putting linear orders on their sets of vertices is not enough for this purpose: one also has to strengthen the notion of subobjects used from “induced subsystems” to something we call “strongly induced subsystems”. Moreover we study the Ramsey properties of other classes of Steiner systems obtained from this class by either forgetting the order or by working with the usual notion of subsystems. This leads to a perhaps surprising induced Ramsey theorem in which designs get coloured.

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

[2]  Lionel Nguyen.  More on the Kechris-Pestov-Todorcevic correspondence: precompact expansions , 2012 .

[3]  Jan Hubivcka,et al.  Bowtie-free graphs have a Ramsey lift , 2014 .

[4]  Slawomir Solecki,et al.  Recent developments in finite Ramsey theory: foundational aspects and connections with dynamics , 2015 .

[5]  Jaroslav Nešetřil,et al.  Simple proof of the existence of restricted ramsey graphs by means of a partite construction , 1981, Comb..

[6]  L. Nguyen Van Th'e,et al.  Structural Ramsey theory of metric spaces and topological dynamics of isometry groups , 2008, 0804.1593.

[7]  Vojtěch Rödl,et al.  On a probabilistic graph-theoretical method , 1978 .

[8]  Vojtech Rödl,et al.  Ramsey Partial Orders from Acyclic Graphs , 2018, Order.

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

[10]  P. ERDŐS-A. HAJNAL-L. PÓSA.  STRONG EMBEDDINGS OF GRAPHS INTO COLORED GRAPHS , 2004 .

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

[12]  A. Hales,et al.  Regularity and Positional Games , 1963 .

[13]  Vojtech Rödl,et al.  Two Proofs of the Ramsey Property of the Class of Finite Hypergraphs , 1982, Eur. J. Comb..

[14]  Nguyen Van The,et al.  Structural Ramsey theory of metric spaces and topological dynamics of isometry groups , 2008 .

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

[16]  Manuel Bodirsky,et al.  Ramsey classes: examples and constructions , 2015, Surveys in Combinatorics.

[17]  Imre Leader,et al.  Sparse Partition Regularity , 2006 .

[18]  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.

[19]  Peter Keevash.  The existence of designs , 2014, 1401.3665.

[20]  Jaroslav Nesetril,et al.  Strong Ramsey theorems for Steiner systems , 1987 .

[21]  Saharon Shelah,et al.  Primitive recursive bounds for van der Waerden numbers , 1988 .

[22]  Lionel Nguyen Van Th'e,et al.  More on the Kechris-Pestov-Todorcevic correspondence: precompact expansions , 2012, 1201.1270.

[23]  Jaroslav Nesetril,et al.  All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms) , 2016, ArXiv.

[24]  Vojtech Rödl,et al.  The partite construction and ramsey set systems , 1989, Discret. Math..

[25]  Vojtěch Rödl,et al.  Combinatorial partitions of finite posets and lattices —Ramsey lattices , 1984 .

[26]  W. T. Trotter,et al.  Graphs and Orders in Ramsey Theory and in Dimension Theory , 1985 .

[27]  Vojtech Rödl,et al.  A short proof of the induced Ramsey Theorem for hypergraphs , 2016, Discret. Math..