Skip to main content
SpringerLink
Log in

Graham-Rothschild Parameter Sets

  • Chapter
Mathematics of Ramsey Theory

Part of the book series: Algorithms and Combinatorics ((AC,volume 5))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abramson, F., Harrington, L.A. (1978): Models without indiscernibles. J. Symb. Logic 43, 572–600

    Article  MathSciNet  MATH  Google Scholar 

  • Baire, R. (1899): Sur les fonctions de variables réelles. Ann. Mat. 3, 1–123

    Google Scholar 

  • Baumgartner, J.E. (1974): A short proof of Hindman’s theorem. J. Comb. Theory, Ser. A 17, 384–386

    Article  MathSciNet  MATH  Google Scholar 

  • Blass, A. (1981): A partition theorem for perfect sets. Proc. Am. Math. Soc. 82, 271–277

    Article  MathSciNet  MATH  Google Scholar 

  • Brown, T.C., Buhler, J.P. (1982): A density version of a geometric Ramsey theorem. J. Comb. Theory, Ser. A 32, 20–34

    Article  MathSciNet  MATH  Google Scholar 

  • Brown, T.C., Buhler, J.P. (1984): Lines imply spaces in density Ramsey theory. J. Comb. Theory, Ser. A 36, 214–220

    Article  MathSciNet  MATH  Google Scholar 

  • Carlson, T.J. (1987): An infinitary version of the Graham-Leeb-Rothschild theorem. J. Comb. Theory, Ser. A 44, 22–33

    Article  MATH  Google Scholar 

  • Carlson, T.J. (1988): Some unifying principles in Ramsey theory. Discrete Math. 68, 117–168

    Article  MathSciNet  MATH  Google Scholar 

  • Carlson, T.J. (In preparation, cf. Carlson, Simpson (1984))

    Google Scholar 

  • Carlson, T.J., Simpson, S.G. (1984): A dual form of Ramsey’s theorem. Adv. Math. 53, 265–290

    Article  MathSciNet  MATH  Google Scholar 

  • Descartes, B. (1948): A three color problem. Eureka

    Google Scholar 

  • Deuber, W. (1973): Partitionen und lineare Gleichungssysteme. Math. Z. 133, 1009–123

    Article  MathSciNet  Google Scholar 

  • Deuber, W. (1975): Partitionstheoreme für Graphen. Comment. Math. Helv. 50, 311–320

    Article  MathSciNet  MATH  Google Scholar 

  • Deuber, W., Rothschild, B. (1978): Categories without the Ramsey property. In: Hajnal, A., Sös, V. (eds.): Combinatorics I. North Holland, Amsterdam, pp. 225–249 (Colloq. Math. Soc. Jânos Bolyai, Vol. 18)

    Google Scholar 

  • Deuber, W., Rothschild, B., Prömel, H.J., Voigt, B. (1981): A restricted version of Hales-Jewett’s theorem. In: Hajnal, A., Lovâsz, L., Sos, V. (eds.): Finite and infinite sets I. North Holland, Amsterdam, pp. 231–246 (Colloq. Math. Soc. Jänos Bolyai, Vol. 37)

    Google Scholar 

  • Deuber, W., Rothschild, B., Voigt, B. (1982): Induced partition theorems. J. Comb. Theory, Ser. A 32, 225–240

    Article  MathSciNet  MATH  Google Scholar 

  • Deuber, W., Voigt, B. (1982): Partitionscigenschaften endlicher affiner und projektiver Räume. Eur. J. Comb. 3, 329–340

    MathSciNet  MATH  Google Scholar 

  • Deuber, W., Graham, R.L., Prömel, H.J., Voigt, B. (1983): A canonical partition theorem for equivalence relations on Zl. J. Comb. Theory, Ser. A 34, 331–339

    Article  MATH  Google Scholar 

  • Dowling, T.A. (1973): A class of geometric lattices based on finite groups. J. Comb. Theory, Ser. B 13, 61–87

    Article  MathSciNet  Google Scholar 

  • Ellentuck, E. (1974): A new proof that analytic sets are Ramsey. J. Symb. Logic 39, 163–165

    Article  MathSciNet  MATH  Google Scholar 

  • Emeryk, A., Frankiewicz, R., Kulpa, W. (1979): On functions having the Baire property. Bull. Pol. Acad. Sci., Math. 27, 489–491

    MathSciNet  Google Scholar 

  • Erdös, P. (1959): Graph theory and probability. Can. J. Math. 11, 34–38

    Article  MATH  Google Scholar 

  • Erdös, P. (1975): Problems and results in combinatorial number theory. In: Journées Arithmétiques de Bordeaux (Bordeaux, 1974). Société Mathématique de France, Paris, pp. 295–310 (Astérisque, No. 24–25)

    Google Scholar 

  • Erdös, P., Hajnal, A. (1966): On the chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hung. 17, 61–69

    Article  MATH  Google Scholar 

  • Erdös, P., Kleitman, D.J. (1971): On collections of subsets containing no 4-member 146 Boolean algebra. Proc. Am. Math. Soc. 28, 87–90

    MATH  Google Scholar 

  • Erdös, P., Rado, R. (1950): A combinatorial theorem. J. Lond. Math. Soc. 25, 249–255

    Article  MATH  Google Scholar 

  • Frankl, P., Graham, R.L., Rödl, V. (1987): Induced restricted Ramsey theorems for spaces. J. Comb. Theory, Ser. A 44, 120–128

    Article  MATH  Google Scholar 

  • Fürstenberg, H. (1981): Recurrence in ergodic theory and combinatorial number theory. Princeton University Press, Princeton, NJ

    Google Scholar 

  • Fürstenberg, H., Katznelson, Y. (1985): An ergodic Szemerédi theorem for IP-systems and combinatorial theory. J. Anal. Math. 45, 117–168

    Article  Google Scholar 

  • Fürstenberg, H., Weiss, B. (1978): Topological dynamics and combinatorial number theory. J. Anal. Math. 34, 61–85

    Article  Google Scholar 

  • Galvin, F., Prikry, K., Wolfsdorf, K. (1984): Ein Zerlegungssatz für P(k). Period. Math. Hung. 15, 21–40

    Article  MathSciNet  MATH  Google Scholar 

  • Graham, R.L., Rothschild, B. (1971): Ramsey’s theorem for n-parameter sets. Trans. Am. Math. Soc. 159, 257–292

    MathSciNet  MATH  Google Scholar 

  • Graham, R.L., Leeb, K., Rothschild, B. (1972): Ramsey’s theorem for a class of categories. Adv. Math. 8, 417–433

    Article  MathSciNet  MATH  Google Scholar 

  • Graham, R.L., Rothschild, B., Spencer, J. (1980): Ramsey theory. J. Wiley & Sons, New York, NY

    MATH  Google Scholar 

  • Graham, R.L. (1984): Recent developments in Ramsey theory. In: Ciesielski, Z., Olech, C. (eds.): Proc. International Congress of Mathematicians (Warsaw, 1983), Vol. 2. North Holland, Amsterdam, pp. 1555–1569

    Google Scholar 

  • Hales, A.W., Jewett, R.I. (1963): Regularity and positional games. Trans. Am. Math. Soc. 106, 222–229

    Article  MathSciNet  MATH  Google Scholar 

  • Halpern, J.D., Läuchli, H. (1966): A partition theorem. Trans. Am. Math. Soc. 124, 360–367

    Article  MATH  Google Scholar 

  • Hindman, N. (1974): Finite sums from sequences within cells of a partition of N. J. Comb. Theory, Ser. A 17, 1–11

    Article  MathSciNet  MATH  Google Scholar 

  • Hindman, N. (1979): Ultrafilters and combinatorial number theory. In: Nathanson, M.B. (ed.): Number theory. Springer Verlag, Berlin, Heidelberg, pp. 119–184 (Lect. Notes Math., Vol. 751)

    Google Scholar 

  • Ježek, J., Nešetřil, J. (1983): Ramsey varieties. Eur. J. Comb. 4, 143–147

    MATH  Google Scholar 

  • Kuratowski, K. (1966): Topology I. Academic Press, New York, NY

    Google Scholar 

  • Lachlan, A.H. (1971): Solution to a problem of Spector. Can. J. Math. 23, 247–256

    Article  MathSciNet  MATH  Google Scholar 

  • Leeb, K. (1973): Vorlesungen über Pascaltheorie. Universität Erlangen-Nürnberg (Unpublished)

    Google Scholar 

  • Leeb, K. (1975): A full Ramsey theorem for the Deuber category. In: Hajnal, A., Rado, R., Sös, V. (eds.): Infinite and finite sets II. North Holland, Amsterdam, pp. 1043–1049 (Colloq. Math. Soc. János Bolyai, Vol. 10)

    Google Scholar 

  • Leeb, K., Prömel, H.J. (1983): Ordering subsets of finite sets. Preprint

    Google Scholar 

  • Lefmann, H. (1985): Kanonische Partitionssätze. Dissertation, Universität Bielefeld

    Google Scholar 

  • Lefmann, H., Voigt, B.: A remark on SIAM J. Discrete Math., to appear

    Google Scholar 

  • Lovász, L. (1968): On the chromatic number of finite set-systems. Acta Math. Acad. Sci. Hung. 19, 59–67

    Article  MATH  Google Scholar 

  • Milliken, K. (1975): Ramsey’s theorem with sums or unions. J. Comb. Theory, Ser. A 18, 276–290

    Article  MathSciNet  MATH  Google Scholar 

  • Moran, G., Strauss, D. (1980): Countable partitions of product spares. Mathematika 27, 213–224

    Article  MathSciNet  MATH  Google Scholar 

  • Nešetřil, J., Rödl, V. (1975): Partitions of subgraphs. In: Fiedler, M. (ed.): Recent advances in graph theory. Academia Praha, Prague, pp. 405–412

    Google Scholar 

  • Nešetřil, J., Rödl, V. (1976): Van der Waerden’s theorem for sequences of integers not containing an arithmetic progression of k terms. Commentat. Math. Univ. Carol. 17, 675–688

    MATH  Google Scholar 

  • Nešetřil, J., Rödl, V. (1977): Partitions of finite relational and set-systems. J. Comb. Theory, Ser. A 22, 289–312

    MATH  Google Scholar 

  • Nešetřil, J., Rödl, V. (1978): Selective graphs and hypergraphs. In: Bollobäs, B. (ed): Advances in graph theory. North Holland, Amsterdam, pp. 181–189 (Ann. Discrete Math., Vol. 3)

    Google Scholar 

  • Nešetřil, J., Rödl, V. (1979): A short proof of the existence of highy chromatic hypergraphs without short cycles. J. Comb. Theory, Ser. B 27, 225–227

    Article  MATH  Google Scholar 

  • Nešetřil, J., Rödl, V. (1980): Dual Ramsey type theorems. In: Proc. 8th Winter School on Abstract Analysis (Prague, 1980). Ceskoslovenska Akademie Ved., Prague, pp. 121–123

    Google Scholar 

  • Nešetřil, J., Prömel, H.J., Rödl, V., Voigt, B. (1982): Canonical ordering theorems, a first attempt. In: Proc. 10th Winter School on Abstract Analysis (Srni, 1982). Circolo Matematico di Palermo, Palermo, pp. 193–197 (Rend. Circ. Mat. Palermo, II. Ser., Suppl. No. 2)

    Google Scholar 

  • Nešetřil, J., Rödl, V. (1983): Ramsey classes of set-systems. J. Comb. Theory, Ser. A 31, 183–201

    Google Scholar 

  • Nešetřil, J. (1984): Some nonstandard Ramsey-like applications. Theor. Comput. Sci. 31, 3–15

    Google Scholar 

  • Nešetřil, J., Rödl, V. (1984): Combinatorial partitions of finite posets and lattices - Ramsey lattices. Algebra Univers. 19, 106–119

    Article  Google Scholar 

  • Nešetřil, J., Rödl, V. (1985): Two remarks on Ramsey’s theorem. Discrete Math. 54, 339–341

    Article  MathSciNet  MATH  Google Scholar 

  • Nešetřil, J., Prömel, H.J., Rödl, V., Voigt, B. (1985): Canonizing ordering theorems for Hales-Jewett structures. J. Comb. Theory, Ser. A 40, 394–408

    Article  MATH  Google Scholar 

  • Oxtoby, J.C. (1971): Measure and category. Springer Verlag, Berlin, Heidelberg (Grad. Texts Math., Vol. 3)

    Book  MATH  Google Scholar 

  • Prikry, K. (1982): In these notes I give….Manuscript

    Google Scholar 

  • Prikry, K. (1985). In: Rival, I. (ed.): Graphs and order. D. Reidel, Dordrecht, p. 561 (NATO ASI Ser., Ser. C, Vol. 147)

    Google Scholar 

  • Prömel, H.J., Voigt, B. (1981): Recent results in partition (Ramsey) theory for finite lattices. Discrete Math. 35, 185–198

    Article  MathSciNet  MATH  Google Scholar 

  • Prömel, H.J. (1982): Induzierte Partitionssätze. Dissertation, Universität Bielefeld

    Google Scholar 

  • Prömel, H.J., Voigt, B. (1983): Canonical partition theorems for parameter sets. J. Comb. Theory, Ser. A 35, 309–327

    Article  MATH  Google Scholar 

  • Prömel, H.J. (1985): Induced partition properties of combinatorial cubes. J. Comb. Theory, Ser. A 39, 177–208

    Article  MATH  Google Scholar 

  • Prömel, H.J., Voigt, B. (1985): Baire sets of k-parameter words are Ramsey. Trans. Am. Math. Soc. 291, 189–201

    MATH  Google Scholar 

  • Prömel, H.J., Voigt, B. (1985): Canonizing Ramsey theory. Preprint

    Google Scholar 

  • Prömel, H.J. (1986): Partition properties of q-hypergraphs. J. Comb. Theory, Ser. B 41, 356–385

    Article  MATH  Google Scholar 

  • Prömel, H.J., Voigt, B. (1986): Hereditary attributes of surjections and parameter sets. Eur. J. Comb. 7, 161–170

    MATH  Google Scholar 

  • Prömel, H.J., Simpson, S.G., Voigt, B. (1986): A dual form of Erdös-Rado’s canonization theorem. J. Comb. Theory, Ser. A 42, 159–178

    Article  MATH  Google Scholar 

  • Prömel, H.J., Rothschild, B. (1987): A canonical restricted version of van der Waerden’s theorem. Combinatorica 7, 115–119

    Article  MathSciNet  MATH  Google Scholar 

  • Prömel, H.J., Voigt, B. (1987): Ramsey theorems for finite graphs I. Report No. 86447-OR, Institut für Operations Research, Universität Bonn

    Google Scholar 

  • Prömel, H.J., Voigt, B. (1988): A sparse Graham-Rothschild theorem. Trans. Am. Math. Soc. 309, 113–137

    Article  MATH  Google Scholar 

  • Prömel, H.J. (1989): Some remarks on natural orders for combinatorial cubes. Discrete Math. 73, 189–198

    Article  MathSciNet  MATH  Google Scholar 

  • Prömel, H.J., Voigt, B.: A short proof of the restricted Ramsey theorem for finite set-systems. J. Comb. Theory, Ser. A, to appear

    Google Scholar 

  • Prömel, H.J., Voigt, B.: Aspects of Ramsey theory. Springer Verlag, Berlin, Heidelberg (To appear)

    Google Scholar 

  • Prömel, H.J., Voigt, B.: Graham-Rothschild parameter words and measurable partitions. Combinatorica, to appear

    Google Scholar 

  • Ramsey, F.P. (1930): On a problem of formal logic. Proc. Lond. Math. Soc., II. Ser. 30, 264–286

    Article  Google Scholar 

  • Rödl, V. (1981): On Ramsey families of sets. Manuscript (Unpublished)

    Google Scholar 

  • Rödl, V. (1982): A note on finite Boolean algebras. Acta Polytech. Prace CVUT Praze, Ser. IV Tech. Teoret. 1, 47–50

    Google Scholar 

  • Schmerl, J. (1985). In: Rival, I (ed.): Graphs and order. D. Reidel, Dordrecht, pp. 539–540 (NATO ASI Ser., Ser. C, Vol. 147)

    Google Scholar 

  • Schmerl, J. (1985): Substructure lattices of nodes of Peano arithmetic. Preprint

    Google Scholar 

  • Shelah, S. (1984): Can you take Solovay’s inaccessible away? Isr. J. Math. 48, 1–47

    Article  MATH  Google Scholar 

  • Shelah, S. (1988): Primitive recursive bounds for van der Waerden numbers. J. Assoc. Comput. Mach. 35, 683–697

    Google Scholar 

  • Spencer, J. (1975): Restricted Ramsey configurations. J. Comb. Theory, Ser. A 19, 278–286

    Article  MATH  Google Scholar 

  • Spencer, J. (1979): Ramsey’s theorem for spaces. Trans. Am. Math. Soc. 249, 363–371

    MATH  Google Scholar 

  • Sperner, E. (1928): Ein Satz über die Untermengen einer endlichen Menge. Math. Z. 27, 544–548

    Article  MathSciNet  MATH  Google Scholar 

  • Szemeredi, E. (1975): On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27, 199–245

    MathSciNet  MATH  Google Scholar 

  • Taylor, A.D. (1976): A canonical partition relation for finite subsets of ω. J. Comb. Theory, Ser. A 21, 137–146

    Article  MATH  Google Scholar 

  • Taylor, A.D. (1981): Bounds for the disjoint unions theorem. J. Comb. Theory, Ser. A 30, 339–344

    Article  MATH  Google Scholar 

  • Thomason, S.K. (1970): Sublattices and initial segments of the degrees of unsolvability. Can. J. Math. 22, 569–581

    Article  MathSciNet  MATH  Google Scholar 

  • Voigt, B. (1980): The partition problem for finite Abelian groups. J. Comb. Theory, Ser. A 28, 257–271

    Article  MathSciNet  MATH  Google Scholar 

  • Voigt, B. (1984): Canonization theorems for finite affine and linear spaces. Combinatorica 4, 219–239

    Article  MathSciNet  MATH  Google Scholar 

  • Voigt, B. (1985): Extensions of the Graham-Leeb-Rothschild theorem. J. Reine Angew. Math. 358, 204–220

    MathSciNet  Google Scholar 

  • Voigt, B. (1985a): Canonizing partition theorems: diversification, products and iterated versions. J. Comb. Theory, Ser. A 40, 349–376

    Article  MathSciNet  MATH  Google Scholar 

  • Voigt, B.: Parameter words, trees and vector spaces. Eur. J. Comb., to appear

    Google Scholar 

  • Voigt, B.: Ellentuck type theorems. J. Symb. Logic, to appear

    Google Scholar 

  • van der Waerden, B.L. (1927): Beweis einer Baudetsehen Vermutung. Nieuw Arch. Wiskd. 15, 212–216

    Google Scholar 

Download references

Authors
  1. Hans J. Prömel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernd Voigt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 11800, Praha 1, Czechoslovakia

    Jaroslav Nešetřil

  2. Department of Mathematics and Computer Science, Emory University, Atlanta, GA, 30322, USA

    Vojtěch Rödl

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Prömel, H.J., Voigt, B. (1990). Graham-Rothschild Parameter Sets. In: Nešetřil, J., Rödl, V. (eds) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72905-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72905-8_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-72907-2

  • Online ISBN: 978-3-642-72905-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation