Abstract
One of the fundamental results in graph theory is the theorem of Turán from 1941, which initiated extremal graph theory. Turán’s theorem was rediscovered many times with various different proofs. We will discuss five of them and let the reader decide which one belongs in The Book.
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
Preview
Unable to display preview. Download preview PDF.
References
M. Aigner: Turán’s graph theorem, Amer. Math. Monthly 102 (1995), 808-816.
N. Alon & J. Spencer: The Probabilistic Method, Wiley Interscience 1992.
P. Erdős: On the graph theorem of Turán (in Hungarian), Math. Fiz. Lapok 21 (1970), 249-251.
T. S. Motzkin & E. G. Straus: Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math. 17 (1965), 533-540.
P. Turán: On an extremal problem in graph theory, Math. Fiz. Lapok 48 (1941), 436-452.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2010). Turán’s graph theorem. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00856-6_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-00856-6_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00855-9
Online ISBN: 978-3-642-00856-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)