Skip to main content

VI. Ramsey's theorem

  • 358 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 382)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.E. Greenwood and A.M. Gleason, Combinatorial Relations and Chromatic Graphs, Can. J. Math. 7 (1955), 1–7.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. A.W. Goodman, On Sets of Acquaintances and Strangers at any Party, Am. Math. Monthly 66 (1959), 778–783.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. A.J. Schwenck, Acquaintance Graph Party Problem, Am. Math. Monthly 79 (1972), 1113–1117.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. K. Walker, Dichromatic Graphs and Ramsey Numbers, J. Comb. Theory 5 (1968), 238–243.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. G. Kéry, Ramsey egy Gráfelmeléti Tététeröl, Mat. Lapok. 15 (1964), 204–224.

    MathSciNet  MATH  Google Scholar 

  6. J.E. Graver and J. Yackel, Some Graph Theoretic Results Associated with Ramsey's Theorem, J. Comb. Theory 4 (1968), 125–175.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. K. Walker, An Upper Bound for the Ramsey Number M(5,4), J. Comb. Theory 11 (1971), 1–10.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. P. Erdös, Some Remarks on the Theory of Graphs, Bull. A.M.S. 53 (1947), 292–294.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. J. Yackel, Inequalities and Asymptotic Bounds for Ramsey Numbers, J. Comb. Theory (B), 13 (1972), 56–68.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. P. Erdös, Graph Theory and Probability II, Can. J. Math. 13 (1961), 346–352.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. P. Turan, Eine Extremalaufgabe aus der Graphentheorie, Math. Fiz. Lapok 48 (1941), 436–452.

    MathSciNet  MATH  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

van Lint, J.H. (1974). VI. Ramsey's theorem. In: Combinatorial Theory Seminar Eindhoven University of Technology. Lecture Notes in Mathematics, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057325

Download citation

  • DOI: https://doi.org/10.1007/BFb0057325

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06735-1

  • Online ISBN: 978-3-540-38316-1

  • eBook Packages: Springer Book Archive