Graham-Rothschild Parameter Sets

In their, by now classical, paper ‘Ramsey’s theorem for n-parameter sets’ (Trans. Amer. Math. Soc. 159 (1971), 257–291) Graham and Rothschild introduced a combinatorial structure which turned out be central in Ramsey theory. In this paper we survey the development related to the structure of Graham-Rothschild parameter sets.

[1]  P. Erdos,et al.  On collections of subsets containing no 4-member Boolean algebra. , 1971 .

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

[3]  E. Sperner.  Ein Satz über Untermengen einer endlichen Menge , 1928 .

[4]  Neil Hindman,et al.  Finite Sums from Sequences Within Cells of a Partition of N , 1974, J. Comb. Theory, Ser. A.

[5]  Tom C. Brown,et al.  Lines Imply Spaces in Density Ramsey Theory , 1984, J. Comb. Theory, Ser. A.

[6]  Tom C. Brown,et al.  A Density Version of a Geometric Ramsey Theorem , 1982, J. Comb. Theory, Ser. A.

[7]  L. Lovász.  On chromatic number of finite set-systems , 1968 .

[8]  Bernd Voigt.  Canonization theorems for finite affine and linear spaces , 1984, Comb..

[9]  Bernd Voigt,et al.  Partitionseigenschaften endlicher affiner und projektiver Räume , 1982, Eur. J. Comb..

[10]  S. K. Thomason.  Sublattices and initial segments of the degrees of unsolvability , 1970 .

[11]  Bernd Voigt,et al.  Baire sets of $k$-parameter words are Ramsey , 1985 .

[12]  Alan D. Taylor.  Bounds for the Disjoint Unions Theorem , 1981, J. Comb. Theory, Ser. A.

[13]  Benjamin Weiss,et al.  Topological dynamics and combinatorial number theory , 1978 .

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

[15]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[16]  Bernd Voigt,et al.  Canonical Partition Theorems for Parameter Sets , 1983, J. Comb. Theory, Ser. A.

[17]  Walter Deuber.  Partitionen und lineare Gleichungssysteme , 1973 .

[18]  E. Szemerédi.  On sets of integers containing k elements in arithmetic progression , 1975 .

[19]  Alan D. Taylor,et al.  A Canonical Partition Relation for Finite Subsets of omega , 1976, J. Comb. Theory, Ser. A.

[20]  Stephen G. Simpson,et al.  A Dual Form of Ramsey's Theorem , 1984 .

[21]  Keith R. Milliken,et al.  Ramsey's Theorem with Sums or Unions , 1975, J. Comb. Theory, Ser. A.

[22]  Béla Bollobás.  Advances in graph theory , 1978 .

[23]  Bernd Voigt.  Canonizing Partition Theorems: Diversification, Products, and Iterated Versions , 1985, J. Comb. Theory, Ser. A.

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

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

[26]  H. Furstenberg,et al.  An ergodic Szemerédi theorem for IP-systems and combinatorial theory , 1985 .

[27]  Vojtech Rödl,et al.  A short proof of the existence of highly chromatic hypergraphs without short cycles , 1979, J. Comb. Theory, Ser. B.

[28]  László Lovász,et al.  Finite and infinite sets , 1984 .

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

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

[31]  Joel H. Spencer.  Restricted Ramsey Configurations , 1975, J. Comb. Theory, Ser. A.

[32]  Vojtech Rödl,et al.  Two remarks on Ramsey's theorem , 1985, Discret. Math..

[33]  Jaroslav Nesetril,et al.  Some Nonstandard Ramsey Like Applications , 1984, Theor. Comput. Sci..

[34]  V. Rödl,et al.  Selective Graphs and Hypergraphs , 1978 .

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

[36]  A. H. Lachlan,et al.  Solution to a Problem of Spector , 1971, Canadian Journal of Mathematics.

[37]  Vojtech Rödl,et al.  Canonizing Ordering Theorems for Hales Jewett Structures , 1985, J. Comb. Theory, Ser. A.

[38]  Bernd Voigt,et al.  A sparse Graham-Rothschild theorem , 1988 .

[39]  James E. Baumgartner,et al.  A Short Proof of Hindman's Theorem , 1974, J. Comb. Theory, Ser. A.

[40]  Timothy J. Carlson,et al.  An infinitary version of the Graham-Leeb-Rothschild theorem , 1987, J. Comb. Theory, Ser. A.

[41]  P. Erdös,et al.  A combinatorial theorem , 1950 .

[42]  Hans Jürgen Prömel.  Partition properties of q-hypergraphs , 1986, J. Comb. Theory, Ser. B.

[43]  J. Spencer.  Ramsey’s theorem for spaces , 1979 .

[44]  Bernd Voigt.  The Partition Problem for Finite Abelian Groups , 1980, J. Comb. Theory, Ser. A.

[45]  H. Prömel,et al.  A RESTRICTED VERSION OF HALES–JEWETT'S THEOREM , 1984 .

[46]  Bruce Rothschild,et al.  A canonical restricted version of van der waerden’s theorem , 1987, Comb..

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

[48]  R. Graham,et al.  Some Recent Developments in Ramsey Theory , 1975 .

[49]  Timothy J. Carlson,et al.  Some unifying principles in Ramsey theory , 1988, Discret. Math..

[50]  J. Schmerl.  Substructure Lattices of Models of Peano Arithmetic , 1986 .

[51]  Hans Jürgen Prömel.  Induced Partition Properties of Combinatorial Cubes , 1985, J. Comb. Theory, Ser. A.

[52]  Hans Jürgen Prömel,et al.  Some remarks on natural orders for combinatorial cubes , 1989, Discret. Math..

[53]  I. Rival.  Graphs and Order , 1985 .

[54]  Vojtech Rödl,et al.  Induced restricted Ramsey theorems for spaces , 1987, J. Comb. Theory, Ser. A.

[55]  R. Baire.  Sur les fonctions de variables réelles , 1899 .

[56]  Erik Ellentuck,et al.  A new proof that analytic sets are Ramsey , 1974, Journal of Symbolic Logic.

[57]  Neil Hindman,et al.  Ultrafilters and combinatorial number theory , 1979 .

[58]  Bruce Rothschild,et al.  Induced Partition Theorems , 1982, J. Comb. Theory, Ser. A.

[59]  Saharon Shelah,et al.  Can you take Solovay’s inaccessible away? , 1984 .

[60]  Walter Von Deuber.  Partitionstheoreme für Graphen , 1975 .

[61]  J. Spencer.  Ramsey Theory , 1990 .

[62]  Vojtech Rödl,et al.  On ramsey families of sets , 1990, Graphs Comb..

[63]  Thomas A. Dowling,et al.  A class of geometric lattices based on finite groups , 1973 .

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

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

[66]  Countable partitions of product spaces. , 1980 .

[67]  P. Erdos,et al.  On chromatic number of graphs and set-systems , 1966 .

[68]  Bernd Voigt,et al.  Hereditary attributes of surjections and parameter sets , 1986, Eur. J. Comb..

[69]  Bernd Voigt,et al.  Recent results in partition (Ramsey) theory for finite lattices , 1981, Discret. Math..

[70]  Bernd Voigt,et al.  A short proof of the restricted Ramsey theorem for finite set systems , 1989, J. Comb. Theory, Ser. A.

[71]  Yi-Ching Yao,et al.  A three color problem , 1991 .

[72]  Ronald L. Graham,et al.  A Canonical Partition Theorem for Equivalence Relations on Zt , 1983, J. Comb. Theory, Ser. A.

[73]  Stephen G. Simpson,et al.  A dual form of Erdös-Rado's canonization theorem , 1986, J. Comb. Theory, Ser. A.

[74]  Andreas Blass,et al.  A partition theorem for perfect sets , 1981 .

[75]  J. C. Oxtoby.  Measure and Category , 1971 .

[76]  Bernd Voigt,et al.  Graham-Rothschild parameter words and measurable partitions , 1991, Comb..