Skip to main content
SpringerLink
Log in
Book cover

Ramsey Theory pp 63–76Cite as

Birkhäuser

On the Function of Erdős and Rogers

  • Chapter
  • First Online:

Part of the book series: Progress in Mathematics ((PM,volume 285))

Abstract

In 1930, Frank Ramsey published a seminal paper “On a problem of formal logic”[13] beginning a new area of research known today as Ramsey theory (for a comprehensive introduction to Ramsey theory see, e.g.,[9]).

The author’s research was partially supported by NSF grant DMS 0800070.

This is a preview of subscription content, 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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.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

Learn about institutional subscriptions

References

  1. N.Alon and M.Krivelevich, Constructive bounds for a Ramsey-type problem, Graphs Combin. 13(1997), 217–225.

    MathSciNet  MATH  Google Scholar 

  2. B.Bollobás and H.R.Hind, Graphs without large triangle free subgraphs, Discrete Math. 87(1991), no.2, 119–131.

    Article  MathSciNet  MATH  Google Scholar 

  3. A.Dudek and V.Rödl, An almost quadratic bound on vertex Folkman numbers, J. Combin. Theory Ser. B 100(2010), no. 2, 132–140.

    Article  MathSciNet  MATH  Google Scholar 

  4. A.Dudek and V.Rödl, On K s -free subgraphs in K s+k -free graphs and vertex Folkman numbers, to appear in Combinatorica.

    Google Scholar 

  5. P.Erdős, Some of my recent problems in combinatorial number theory, geometry and combinatorics, in: Graph Theory, Combinatorics, and Algorithms, vols.1,2, Wiley, New York, 1995, 335–349.

    Google Scholar 

  6. P.Erdős and T.Gallai, On the minimal number of vertices representing the edges of a graph, Publ. Math. Inst. Hungar. Acad. Sci. 6(1961), 181–202.

    Google Scholar 

  7. P.Erdős and C.A.Rogers, The construction of certain graphs, Can. J.Math.14(1962), 702–707.

    Article  Google Scholar 

  8. C.Godsil and G.Royle, Algebraic Graph Theory, Springer, New York, 2001.

    Book  MATH  Google Scholar 

  9. R.Graham, B.Rothschild, and J.Spencer, Ramsey Theory, Wiley, New York, 1990.

    MATH  Google Scholar 

  10. M.Krivelevich, Bounding Ramsey numbers through large deviation inequalities, Random Struct. Algorithms 7(1995), 145–155.

    Article  MathSciNet  MATH  Google Scholar 

  11. M.Krivelevich, K s -free graphs without large K r -free subgraphs, Combin. Probab. Comput. 3(1994), 349–354.

    Article  MathSciNet  MATH  Google Scholar 

  12. C. J. H. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics 1989, London Math. Society Lecture Notes Series 141 (Siemons J., ed.), Cambridge University Press (1989), 148–188.

    Google Scholar 

  13. F.Ramsey, On a problem of formal logic, Proc. Lond. Math. Soc. 30(1930), 264–286.

    Article  MathSciNet  Google Scholar 

  14. B.Sudakov, A new lower bound for a Ramsey-type problem, Combinatorica 25(2005), 487–498.

    Article  MathSciNet  MATH  Google Scholar 

  15. B.Sudakov, Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems, Random Struct. Algorithms 26(2005), 253–265.

    Article  MathSciNet  MATH  Google Scholar 

  16. J.Thas, Generalized polygons, in: F. Buekenhout (ed.), Handbook on Incidence Geometry, North-Holland, Amsterdam (1995) 383–431.

    Chapter  Google Scholar 

Download references

Acknowledgment

The authors would like to thank Alexander Soifer for organizing the successful DIMACS Workshop “Ramsey Theory Yesterday, Today and Tomorrow.”

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213, USA

    Andrzej Dudek

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

    Vojtěch Rödl

Authors
  1. Andrzej Dudek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vojtěch Rödl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Dudek .

Editor information

Editors and Affiliations

  1. at Colorado Springs, College of Letters, Arts, and Sciences, University of Colorado, Austin Bluffs Parkway 1420, Colorado Springs, 80918, Colorado, USA

    Alexander Soifer

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Dudek, A., Rödl, V. (2011). On the Function of Erdős and Rogers. In: Soifer, A. (eds) Ramsey Theory. Progress in Mathematics, vol 285. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8092-3_4

Download citation

Publish with us

Policies and ethics

Search

Navigation