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.
Three pair densities equal to need not produce a single transversal triangle
Statement
There are three pairwise disjoint vertex sets for which every cross-density equals but no transversal triple spans a triangle.
Facts & Assumptions
Given: Three nonempty even-sized sets, each split equally into parts labelled and .
Cross-density is the proportion of possible cross-pairs that are edges (Edge counts and densities between nonempty vertex sets).
The triangle counting lemma requires regularity in addition to positive pair densities (Triangle counting lemma for three pairwise regular vertex sets).
Counterexample
Join to and to exactly when the endpoint labels agree, and join to exactly when their labels differ.
For each cross-pair and each vertex, exactly half the vertices on the other side are neighbours. Thus all three densities are by [L1].
Suppose, for contradiction, that is a transversal triangle. Its and edges force the three labels to satisfy , while its edge forces .
This contradiction shows that no transversal triangle exists. Therefore density alone does not imply the conclusion of [L2]; its regularity hypothesis carries real content.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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
- Y. Zhao, Graph Theory and Additive Combinatorics, Theorem 2.2.1 and Remark 2.2.2 (standard reference, not scraped)