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.
Omitting cross-block purity breaks the transversal conclusion
Statement refuted
It is false that one wide pure-partition block selected from each comb block must form a pure transversal if cross-block purity is omitted.
Facts & Assumptions
Given: Four comb blocks and teeth . Each is complete to and anticomplete to the other . Take the one-block partitions . Put precisely one edge, , between and , and put no edges between any other distinct pair of blocks.
The specified tooth/block incidences make these four pairs an -comb (Combs in a graph).
A pair is mixed when it is neither complete nor anticomplete (Edges between disjoint vertex sets; complete, anticomplete, pure and mixed pairs).
Counterexample
Each one-block partition is vacuously a pure blockade, and ; [F1] confirms that the ambient blocks are a comb.
The pair has the edge but, for example, does not have . It is neither anticomplete nor complete, hence is mixed by [F2].
Therefore the four wide selected blocks are not a pure transversal. The missing cross-block-purity condition is exactly what fails here.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Huang, Ju, and Zhou, Erdős–Hajnal beyond the five-vertex path, condition (2.3) and Claim 5.1.1 (standard reference, not scraped)