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.
Fox–Sudakov: a quantitative density form of Rödl's theorem
Statement
For every finite graph there exists a constant such that for every real with and every finite -free graph , there is a vertex set with such that one of the induced graphs and has at most edges.
Remarks
This page uses only that -free specialization and keeps the source's base-2 logarithm convention. A local proof belongs to the quantitative induced-density track rather than to this page, so the result is recorded here and cited by Every -free graph has a homogeneous set of size at least .
Used by
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Matija Bucić, Tung Nguyen, Alex Scott, and Paul Seymour, Induced subgraph density. I. A loglog step towards Erdős-Hajnal, Theorem 1.5 (standard reference, not scraped)