A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Stability-type results for hereditary properties
2009
Journal of Graph Theory
The classical Stability Theorem of Erdős and Simonovits can be stated as follows. For a monotone graph property P, let t ≥ 2 be such that t + 1 = min{χ(H) : H / ∈ P}. Then any graph G * ∈ P on n vertices, which was obtained by removing at most ( 1 t + o(1)) n 2 edges from the complete graph G = K n , has edit distance o(n 2 ) to T n (t), the Turán graph on n vertices with t parts. In this paper we extend the above notion of stability to hereditary graph properties. It turns out that to do so
doi:10.1002/jgt.20388
fatcat:3odqiv2wnrbzzos6cg6aywn2fy