Erdős–Stone theorem
From Wikipedia, the free encyclopedia
In extremal graph theory, the Erdős–Stone theorem is an asymptotic result generalising Turán's theorem to bound the number of edges in an H-free graph for a non-complete graph H. It is named after Paul Erdős and Arthur Stone, who proved it in 1946,[1] and it has been described as the “fundamental theorem of extremal graph theory”.[2]
The extremal function ex(n; H) is defined to be the maximum number of edges in a graph of order n not containing a subgraph isomorphic to H. Turán's theorem says that ex(n; Kr) = tr − 1(n), the order of the Turán graph, and that the Turán graph is the unique extremal graph. The Erdős-Stone theorem extends this to Kr(t), the complete r-partite graph with t vertices in each class, or equivalently the Turán graph T(rt,r):
An immediate corollary is that this applies to any graph H with chromatic number r, since such a graph is contained in Kr(t) for sufficiently large t but is not contained in any Turán graph Tr-1(n). For bipartite graphs H, however, the theorem gives only the limited information that ex(n; H) = o(n2), and for general bipartite graphs little more is known.
[edit] Quantitative results
Several versions of the theorem have been proved that more precisely characterise the relation of n, r, t and the o(1) term. Define the notation[3] sr,ε(n) (for 0 < ε < 1/(2(r − 1))) to be the greatest t such that every graph of order n and size
contains a Kr(t).
Erdős and Stone proved that
for n sufficiently large. The correct order of sr,ε(n) in terms of n was found by Bollobás and Erdős[4]: for any given r and ε there are constants c1(r, ε) and c2(r, ε) such that c1(r, ε) log n < sr,ε(n) < c2(r, ε) log n. Chvátal and Szemerédi[5] then determined the nature of the dependence on r and ε, up to a constant:
- for sufficiently large n.
[edit] References
- ^ Erdős, P.; Stone, A. H. (1946). "On the structure of linear graphs". Bulletin of the American Mathematical Society 52: 1087–1091. doi: .
- ^ Bollobás, Béla (1998). Modern Graph Theory. New York: Springer-Verlag, p. 120. ISBN 0-387-98491-7.
- ^ Bollobás, Béla (1995). "Extremal graph theory", in R. L. Graham, M. Grötschel and L. Lovász (eds.): Handbook of combinatorics. Elsevier, p. 1244. ISBN 0-444-88002-X.
- ^ Bollobás, B.; Erdős, P. (1973). "On the structure of edge graphs". Bulletin of the London Mathematical Society 5: 317–321. doi: .
- ^ Chvátal, V.; Szemerédi, E. (1981). "On the Erdős-Stone theorem". Journal of the London Mathematical Society 23 (2): 207–214. doi: .