Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs
A graph is H-free if it has no induced subgraph isomorphic to H, and |G| denotes the number of vertices of G. A conjecture of Conlon, Sudakov and the second author asserts that: • For every graph H, there exists ε > 0 such that in every H-free graph G with |G| there are t...
| Main Authors: | , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Wiley
2020
|