The regularity method for graphs with few 4‐cycles
We develop a sparse graph regularity method that applies to graphs with few 4-cycles, including new counting and removal lemmas for 5-cycles in such graphs. Some applications include: * Every $n$-vertex graph with no 5-cycle can be made triangle-free by deleting $o(n^{3/2})$ edges. * For $r...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022
|
| Online Access: | https://hdl.handle.net/1721.1/145893 |