Skip to main content

Finite Ramsey theory is hard

Invited Papers

  • 578 Accesses

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

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   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
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. J.A. Bondy and U.S.R. Murty, “Graph theory with applications”, Macmillan, London, 1976.

    CrossRef  MATH  Google Scholar 

  2. S.A. Burr, “Generalized Ramsey theorems for graphs—a survey” in Graphs and Combinatorics, lecture notes in Mathematics 406, Springer 1974, 52–75.

    Google Scholar 

  3. G. Chartrand, A.D. Polimeni, C.C. Rousseau, J. Sheehan and M.J. Stewart, “On Star-Book Ramsey numbers”, Proceedings of Kalamazoo Int. Conference (1980), to appear.

    Google Scholar 

  4. M. Clancy, “Some small Ramsey numbers”, J.G.T. 1 (1977), 89–91.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. P. Erdös and G. Szekeres, “A combinatorial problem in geometry”, Compositio Math. 2 (1935) 463–470.

    MathSciNet  MATH  Google Scholar 

  6. P. Erdös, “Some remarks on the theory of graphs”, Bull. Amer. Math. Soc. 53 (1947), 292–294.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. P. Erdös, “On the number of complete subgraphs contained in certain graphs”, Magyar Tud. Akad. Mat. Kut. Int. Közl 7 (1962) 459–474.

    MathSciNet  MATH  Google Scholar 

  8. P. Erdös, R.J. Faudree, C.C. Rousseau and R.H. Schelp, “The size Ramsey number”, Per. Math. Hungar. 9 (1978) 145–162.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. R.J. Evans, J.R. Pulham and J. Sheehan, “On the number of complete subgraphs contained in certain graphs”, J.C.T. Ser B (to appear).

    Google Scholar 

  10. L. Gerencsér and A. Gyárfas, “On Ramsey-type problems”, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 10 (1967), 167–170.

    MathSciNet  MATH  Google Scholar 

  11. G. Giraud, “Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey”, J.C.T. Ser. B 27 (1979), 237–253.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. A.W. Goodman, “On sets of acquaintances and strangers at any party”, American Math. Monthly, 68 (1961), 107–111.

    CrossRef  Google Scholar 

  13. J. E. Graver and J. Yackel, “Some graph theoretic results associated with Ramsey's theorem”, J.C.T. 4 (1968), 125–175.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. R.E. Greewood and A.M. Gleason, “Combinatorial relations and chromatic graphs”, Canad. J. Math. 7 (1955), 1–7.

    CrossRef  MathSciNet  Google Scholar 

  15. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.

    MATH  Google Scholar 

  16. F. P. Ramsey, “On a problem of formal logic”, Proc. London Math. Soc. 30 (1930) 264–286.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. C.C. Rousseau and J. Sheehan, “On Ramsey numbers for books”, J.G.T. 2 (1) (1978), 77–87.

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. C.C. Rousseau and J. Sheehan, “A class of Ramsey problems involving trees”, J. London Math. Soc. (2), 18 (1978), 392–396.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. A. G. Thomason, Ph.D. Thesis, Cambridge University, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Sheehan, J. (1981). Finite Ramsey theory is hard. In: McAvaney, K.L. (eds) Combinatorial Mathematics VIII. Lecture Notes in Mathematics, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0091811

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10883-2

  • Online ISBN: 978-3-540-38792-3

  • eBook Packages: Springer Book Archive