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 bull graph is self-complementary
Example
The bull graph is isomorphic to its complement.
Facts & Assumptions
Given: The bull graph on vertices .
The bull has edges , , , , and (The bull graph).
In the complement graph, two distinct vertices are adjacent exactly when they are nonadjacent in the original graph (Graph isomorphisms, automorphisms and graph complements).
Verification
Define by , , , , and . Using [F1] and [F2], one checks that the five complement-edges are exactly the images under of the five bull edges.
Thus is an isomorphism from the bull to its complement, so the bull is self-complementary.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- Maria Chudnovsky and Shmuel Safra, The Erdős-Hajnal conjecture for bull-free graphs, Section 1 (standard reference, not scraped)