DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01
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 left six-vertex prime -graph
Definition
The left six-vertex prime -graph is the graph on vertices
with edge set
Thus span a triangle, and each is a leaf attached only to the corresponding triangle vertex .
Used by
- The two six-vertex prime H-graphs have the Erdős-Hajnal property Corollary
- The right six-vertex prime H-graph Definition
- The left six-vertex prime H-graph is prime, and deleting any pendant leaf gives the bull Example
- The right six-vertex prime H-graph is the complement of the left one, and is prime Example
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Tung Nguyen, Alex Scott, and Paul Seymour, Induced subgraph density. IV. New graphs with the Erdős-Hajnal property, Figure 1 (standard reference, not scraped)
- Shenwei Huang, Yiao Ju, and Yidong Zhou, Erdős-Hajnal beyond the five-vertex path, Figure 2 (standard reference, not scraped)