Skip to main content

Canonical Partitions

  • Chapter
  • First Online:
Ramsey Theory for Discrete Structures
  • 1180 Accesses

Abstract

In this chapter unrestricted colorings of parameter words are investigated and their canonical patterns are determined. As applications we derive a canonizing version of van der Waerden’s theorem from the corresponding result for zero-parameter words and the finite form of the Erdős-Rado canonization theorem from a canonizing version of the Graham-Rothschild theorem. In fact, throughout this chapter we will consider only parameter words over the trivial group.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

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

    Article  MATH  Google Scholar 

  • Erdős, P., Graham, R.L.: Old and new problems and results in combinatorial number theory. In: Monographies de L’Enseignement Mathématique, vol. 28. L’Enseignement mathématique, Geneva (1980)

    Google Scholar 

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

    Article  Google Scholar 

  • Nešetřil, J., Rödl, V.: Selective graphs and hypergraphs. Ann. Discrete Math. 3, 181–189 (1978b)

    Article  MathSciNet  MATH  Google Scholar 

  • Nešetřil, J., Rödl, V.: Ramsey theorem for classes of hypergraphs with forbidden complete subhypergraphs. Czechoslovak Math. J. 29, 202–218 (1979)

    MathSciNet  Google Scholar 

  • Prömel, H.J., Rödl, V.: An elementary proof of the canonizing version of Gallai-Witt’s theorem. J. Comb. Theory A 42, 144–149 (1986)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Prömel, H.J., Voigt, B.: Canonical partition theorems for finite distributive lattices. In: Proceedings of the 10th Winter School on Abstract Analysis (Srní, 1982), Palermo, suppl. 2, pp. 223–237 (1982)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Schmerl, J.H.: Finite substructure lattices of models of Peano arithmetic. Proc. Am. Math. Soc. 117, 833–838 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  • Spencer, J.: Canonical configurations. J. Comb. Theory A 34, 325–330 (1983)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Prömel, H.J. (2013). Canonical Partitions. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_6

Download citation

Publish with us

Policies and ethics