Name
Abstract | ||
|---|---|---|
The Erdos-Simonovits stability theorem states that for all epsilon > 0 there exists a > 0 such that if G is a Kr+1-free graph on n vertices with epsilon(G) > ex(n, Kr+1) - alpha n(2), then one can remove epsilon n(2) edges from G to obtain an r-partite graph. Furedi gave a short proof that one can choose alpha = epsilon. We give a bound for the relationship of a and e which is asymptotically sharp as epsilon -> 0. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1017/S0963548320000590 | COMBINATORICS PROBABILITY & COMPUTING |
DocType | Volume | Issue |
Journal | 30 | 4 |
ISSN | Citations | PageRank |
0963-5483 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| József Balogh | 1 | 0 | 1.35 |
| Felix Christian Clemen | 2 | 0 | 2.03 |
| Mikhail Lavrov | 3 | 0 | 0.34 |
| Bernard Lidický | 4 | 0 | 1.01 |
| Florian Pfender | 5 | 0 | 0.34 |