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.
The -homogeneous property
Definition
Let and be natural numbers. A finite graph has the -homogeneous property if every -element subset contains a homogeneous subset with (Homogeneous vertex sets and the homogeneous number ).
A class of finite graphs has the -homogeneous property if every graph in has it.
Remarks
- When , the condition on -element subsets is vacuous.
- The property is designed to be used on exact -vertex induced subgraphs: later proofs first build such a subgraph and then extract the homogeneous -set from it.
Depends on
Used by
Dependency tree · two levels
2 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
- M. Bucić, J. Fox, and H. T. Pham, Equivalence between Erdős-Hajnal and polynomial Rödl and Nikiforov conjectures, Lemma 13 (standard reference, not scraped)