Abstract
Sparse Ramsey theorems for graphs originated with investigations of graphs having large chromatic number and high girth (where the girth of a graph is the length of the smallest cycle in G). Note that this can be viewed as a special kind of restricted graph Ramsey problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Descartes, B.: A three color problem. Eureka, University of Cambridge (1948)
Erdős, P.: Graph theory and probability. Can. J. Math. 11, 34–38 (1959)
Erdős, P., Hajnal, A., Máté, A., Rado, R.: Combinatorial Set Theory: Partition Relations for Cardinals. North-Holland, Amsterdam (1984)
Mycielski, J.: Sur le coloriage des graphs. Colloq. Math. 3, 161–162 (1955)
Nešetřil, J., Rödl, V.: Partitions of vertices. Comment. Math. Univ. Carol. 17, 85–95 (1976a)
Nešetřil, J., Rödl, V.: Selective graphs and hypergraphs. Ann. Discrete Math. 3, 181–189 (1978b)
Prömel, H.J., Voigt, B.: A sparse Graham-Rothschild theorem. Trans. Am. Math. Soc. 309, 113–137 (1988)
Rödl, V.: On Ramsey families of sets. Graphs Comb. 6, 187–195 (1990)
Spencer, J.: Restricted Ramsey configurations. J. Comb. Theory A 19, 278–286 (1975b)
Zykov, A.A.: On some properties of linear complexes. Am. Math. Soc. Transl. 1952, 33 (1952)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Prömel, H.J. (2013). Sparse Ramsey Theorems. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-01315-2_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01314-5
Online ISBN: 978-3-319-01315-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)