Abstract
Turán’s Theorem provides a relation between the number of vertices n, the number of edges e, and the independence number α of a graph G. In the simplest case, when e = tn/2 and (t + 1)|n, Turan’s Theorem yields α ≥ n/(t +1). This inequality is best possible. An extremal graph is given by letting G be the union of n/(t + 1) vertex disjoint cliques, each on t + 1 vertices.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M., Komlos, J., Szemeredi, E. (1980): A note on Ramsey numbers. J. Comb. Theory, Ser. A 29, 354–360
Ajtai, M., Erdos, P., Komlos, J., Szemeredi, E. (1981): On Turan’s theorem for sparse graphs. Combinatorica 1, 313–317
Ajtai, M., Komlos, J., Szemeredi, E. (1981): A dense infinite Sidon sequence. Eur. J. Comb. 2, 1–11
Ajtai, M., Komlos, J., Pintz, J., Spencer, J., Szemeredi, E. (1982): Extremal uncrowded hypergraphs. J. Comb. Theory, Ser. A 32, 321–335
Erdos, P. (1961): Graph theory and probability II. Can. J. Math. 13, 346–352
Graver, J.E., Yackel, J. (1968): Some graph theoretic results associated with Ramsey’s theorem. J. Comb. Theory 4, 125–175
Komlos, J., Pintz, J., Szemeredi, E. (1982): A lower bound for Heilbronn’s problem. J. Lond. Math. Soc., II. Ser. 25, 13–24
Roth, K.F. (1951): On a problem of Heilbronn. J. Lond. Math. Soc. 26, 198–204
Shearer, J. (1983): A note on the independence number of triangle-free graphs. Discrete Math. 46, 83–87
Spencer, J. (1977): Asymptotic lower bounds for Ramsey functions. Discrete Math. 20, 69–76
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Spencer, J. (1990). Uncrowded Graphs. In: Nešetřil, J., Rödl, V. (eds) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72905-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-72905-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-72907-2
Online ISBN: 978-3-642-72905-8
eBook Packages: Springer Book Archive