Minimum degree stability of H-free graphs
<p>Given an $(r + 1)$-chromatic graph $H$, the fundamental edge stability result of Erdős and Simonovits says that all $n$-vertex $H$-free graphs have at most $(1 - 1/r + o(1)) \binom{n}{2}$ edges, and any $H$-free graph with that many edges can be made $r$-partite by deleting $o(n^{2})$ edges...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2021
|