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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
N.Alon and M.Krivelevich, Constructive bounds for a Ramsey-type problem, Graphs Combin. 13(1997), 217–225.
B.Bollobás and H.R.Hind, Graphs without large triangle free subgraphs, Discrete Math. 87(1991), no.2, 119–131.
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.
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.
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.
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.
P.Erdős and C.A.Rogers, The construction of certain graphs, Can. J.Math.14(1962), 702–707.
C.Godsil and G.Royle, Algebraic Graph Theory, Springer, New York, 2001.
R.Graham, B.Rothschild, and J.Spencer, Ramsey Theory, Wiley, New York, 1990.
M.Krivelevich, Bounding Ramsey numbers through large deviation inequalities, Random Struct. Algorithms 7(1995), 145–155.
M.Krivelevich, K s -free graphs without large K r -free subgraphs, Combin. Probab. Comput. 3(1994), 349–354.
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.
F.Ramsey, On a problem of formal logic, Proc. Lond. Math. Soc. 30(1930), 264–286.
B.Sudakov, A new lower bound for a Ramsey-type problem, Combinatorica 25(2005), 487–498.
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.
J.Thas, Generalized polygons, in: F. Buekenhout (ed.), Handbook on Incidence Geometry, North-Holland, Amsterdam (1995) 383–431.
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
Corresponding author
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-0-8176-8092-3_4
Published:
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-8091-6
Online ISBN: 978-0-8176-8092-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)