Graphs and Combinatorics

, Volume 11, Issue 2, pp 179–199

What we know and what we do not know about Turán numbers

Authors

  • Alexander Sidorenko
    • Courant Institute of Mathematical SciencesNew York University
Article

DOI: 10.1007/BF01929486

Cite this article as:
Sidorenko, A. Graphs and Combinatorics (1995) 11: 179. doi:10.1007/BF01929486

Abstract

The numbers which are traditionally named in honor of Paul Turán were introduced by him as a generalization of a problem he solved in 1941. The general problem of Turán having anextremely simple formulation but beingextremely hard to solve, has become one of the most fascinatingextremal problems in combinatorics. We describe the present situation and list conjectures which are not so hopeless.

Download to read the full article text

Copyright information

© Springer-Verlag 1995