Skip to main content

A survey of generalized ramsey theory

Part I: Invited Papers

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

Abstract

This is a progress report on a very dynamic branch of graph theory. We begin with a historical review of the origins of generalized ramsey theory and then indicate the small graphs for which the diagonal ramsey numbers are now known. The ramsey multiplicity of a graph is taken up and applied to ramsey games. We conclude with a listing of those families of graphs for which the ramsey numbers have been determined. There still does not exist any general powerful method for computing ramsey numbers.

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   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Burr, S. A., Generalized Ramsey Theory for Graphs — a Survey, this volume p. 52

    Google Scholar 

  2. Burr, S. A., Diagonal Ramsey Numbers for Small Graphs, to appear.

    Google Scholar 

  3. Burr, S. A., and Roberts, J. A., On Ramsey Numbers for Linear Forests, Discrete Math, to appear.

    Google Scholar 

  4. Chvátal, V., Tree — Complete Graph Ramsey Numbers, J. Combinatorial Theory, to appear.

    Google Scholar 

  5. Chvátal, V., and Clancy, M., Diagonal Ramsey Numbers for Most 5-point Graphs, to appear.

    Google Scholar 

  6. Chvátal, V., and Harary, F., Generalized Ramsey Theory for Graphs, Bull. Amer. Math. Soc. 78 (1972) 423–426.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. ____, Generalized Ramsey Theory for Graphs I, Diagonal Numbers, Periodica Math. Hungar. 3(1973) 113–122.

    CrossRef  Google Scholar 

  8. ____, Generalized Ramsey Theory for Graphs, II, Small Diagonal Numbers, Proc. Amer. Math. Soc. 32 (1972) 389–394.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. ____, Generalized Ramsey Theory for Graphs, III, Small Off-Diagonal Numbers, Pacific J. Math. 41 (1972) 335–345.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Cockayne, E. J., An Application of Ramsey's Theorem, Canad. Math. Bull. 13 (1970) 145–146.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Cockayne, E. J., and Lorimer, P. J., On Ramsey Numbers for Stars and Stripes, Canad. Math. Bull., to appear.

    Google Scholar 

  12. Erdös, P., Applications of Probabilistic Methods to Graph Theory, A Seminar on Graph Theory (F. Harary, ed.) Holt, 1967, 60–64.

    Google Scholar 

  13. Faudree, R. J., Lawrence, S. L., Parsons, T. D., and Schelp, R. H., Path-cycle Ramsey Numbers, to appear.

    Google Scholar 

  14. Faudree, R. J., and Schelp, R. H., All Ramsey Numbers for Cycles in Graphs, to appear.

    Google Scholar 

  15. Gardner, M., Mathematical Games, Scientific American 228 (January, 1973) 108–111.

    CrossRef  Google Scholar 

  16. Gerencśer, L., and Gyárfás, A., On Ramsey-type Problems, Ann. Univ. Sci. Budapest Eötvös 10 (1967) 167–170.

    MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. Harary, F., Graph Theory, Addison-Wesley, Reading, 1969.

    Google Scholar 

  19. Harary, F., The Two-Triangle Case of the Acquaintance Graph, Math. Mag. 45 (1972) 130–135.

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. Harary, F., Recent Results on Generalized Ramsey Theory for Graphs, Graph Theory and Applications (Y. Alavi, et al. eds.), Springer, Berlin, 1972, 125–138.

    CrossRef  Google Scholar 

  21. Harary, F., and Hell, P., Generalized Ramsey Theory for Graphs, V, Ramsey Numbers for Digraphs, Bull. London Math. Soc., to appear.

    Google Scholar 

  22. Harary, F., and Prins, G., Generalized Ramsey Theory for Graphs IV, Ramsey Multiplicities, Networks, to appear.

    Google Scholar 

  23. Parsons, T. D., Path-star Ramsey Numbers, Proc. Amer. Math. Soc., to appear.

    Google Scholar 

  24. Ramsey, F. P., On a Problem of Formal Logic, Proc. London Math. Soc. 30 (1930) 264–286.

    CrossRef  MathSciNet  Google Scholar 

  25. Rosta, V., On a Ramsey Type Problem of J. A. Bondy and P. Erdös, I, II, J. Combinatorial Theory, 15B (1973), 94–104, 105–120.

    MathSciNet  Google Scholar 

  26. Schwenk, A. J., Acquaintance Graph Party Problem, Amer. Math. Monthly, 79 (1972) 1113–1117.

    CrossRef  MathSciNet  MATH  Google Scholar 

  27. Simmons, G. J., The Game of Sim, J. Recreational Math. 2 (1969) 66.

    Google Scholar 

  28. Williamson, J., A Ramsey-type Problem for Paths in Digraphs, Math. Ann. 203 (1973) 117–118.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Harary, F. (1974). A survey of generalized ramsey theory. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066430

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06854-9

  • Online ISBN: 978-3-540-37809-9

  • eBook Packages: Springer Book Archive