How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
An H-free graph has a linearly large induced subgraph whose graph or complement has bounded maximum degree
Statement
For every finite graph and every real , there exists such that every nonempty -free graph contains a set with for which one of or has maximum degree at most .
Facts & Assumptions
Given: A finite graph , a real , and a nonempty -free graph .
For every graph and every real , there exists such that every nonempty -free graph contains a set with and either or (The edge-density form of Rödl's theorem: every nonempty -free graph has a linearly large set of self-density at most or at least ).
If a graph on vertices has at most edges, then for every integer with it has an -vertex induced subgraph of maximum degree at most (A sparse graph has a prescribed-size induced subgraph of bounded maximum degree).
Proof
Put . If , then . The conclusion is trivial with , because every induced subgraph has maximum degree at most . So we may assume , and [L1] gives for the parameter . Set .
Apply [L1] to the given nonempty -free graph . Then there is with and either or . Let . Since is an integer and , we have , so .
First suppose . Writing , the definition of density gives . If , then and itself already has maximum degree . If , then , so . Applying [L2] with gives a set with and maximum degree at most .
Now suppose instead that . If , then . Applying step 3.1 to the complement graph on the same vertex set yields with such that has maximum degree at most .
In either case there is a set with such that one of or has maximum degree at most .
Depends on
- The edge-density form of Rödl's theorem: every nonempty $H$-free graph has a linearly large set of self-density at most $\epsilon$ or at least $1-\epsilon$
- A sparse graph has a prescribed-size induced subgraph of bounded maximum degree
- Edge counts and densities between nonempty vertex sets
- Graph isomorphisms, automorphisms and graph complements
- $H$-free and $\mathcal F$-free graphs under the induced-subgraph convention
Used by
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Maria Chudnovsky, Alex Scott, Paul Seymour, and Sophie Spirkl, Erdős-Hajnal for graphs with no 5-hole, Theorem 4.3 (standard reference, not scraped)
- Tung H. Nguyen, Notes on Recent Work on the Erdős-Hajnal Conjecture, proof sketch around Theorem 1.3 (standard reference, not scraped)