Strengthening Rödl's theorem
What can be said about the structure of graphs that do not contain an induced copy of some graph H? Rödl showed in the 1980s that every H-free graph has large parts that are very sparse or very dense. More precisely, let us say that a graph F on n vertices is ε-restricted if either F or its compleme...
Main Authors: | Chudnovsky, M, Scott, A, Seymour, P, Spirkl, S |
---|---|
Format: | Journal article |
Language: | English |
Published: |
Elsevier
2023
|
Similar Items
-
Frankl-Rödl-type theorems for codes and permutations
by: Keevash, P, et al.
Published: (2016) -
The Rödl nibble
by: Bazzi, M
Published: (2012) -
Polynomial bounds for chromatic number VI. Adding a four-vertex path
by: Chudnovsky, M, et al.
Published: (2023) -
Pure pairs. X. Tournaments and the strong Erdos-Hajnal property
by: Chudnovsky, M, et al.
Published: (2023) -
Bipartite graphs with no K6 minor
by: Chudnovsky, M, et al.
Published: (2023)