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.
Edge density and the asymptotic notations , , , and for extremal functions
Definition
For an -vertex graph with , its edge density is
The normalized extremal number is for .
For eventually nonnegative functions with eventually:
- means that some satisfy for ;
- means ;
- means that some satisfy for ;
- means both and .
A subscript, as in , permits the hidden constant and threshold to depend on the subscripted parameters. No normalized edge density is assigned when because .
Depends on
Used by
- Erdős–Stone–Simonovits determines the extremal number for every graph False statement
- ex(n,H)/binom n2 is nonincreasing for n≥2 Proposition
- Every finite graph with an edge has a Turán density π(H)=lim_n→∞ex(n,H)/binom n2 Theorem
- Hypergraph KST: ex(n,K⁽ʳ⁾_s,…,s)=O_r,s(n^r-1/sʳ⁻¹)=o(nʳ) Theorem
- Kővári–Sós–Turán: exact bipartite and ordinary-graph upper bounds for excluding K_s,t Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 44 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Yufei Zhao, Graph Theory and Additive Combinatorics (standard reference, not scraped)