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 is prime, and deleting any pendant leaf gives the bull
Example
The left six-vertex prime -graph is prime, and deleting any of its three leaves produces the bull graph.
Facts & Assumptions
Given: The left six-vertex prime -graph on triangle vertices and leaves .
A graph is prime exactly when it has no nontrivial module (Prime graphs: those whose only modules are the trivial ones, Modules of a graph, and the trivial modules).
The bull is a triangle with leaves attached to two distinct triangle vertices (The bull graph).
Verification
Deleting any leaf gives the bull. For instance, after deleting the triangle remains, with leaves at and at ; by [L2] this is the bull. The same argument works for deleting or .
To check primeness, let be a nontrivial module. First, cannot contain two leaves: if it contains and omits one support, that support sees its own leaf but not the other; if it contains both supports as well, then either the remaining triangle vertex or the remaining leaf splits the set. Hence contains at most one leaf.
Now cannot contain one leaf together with another vertex. If , then another triangle vertex is adjacent to but not to . If and , then any other vertex of is either another leaf, excluded by step 1.2, or some with , and then is outside and adjacent to but not to . Therefore a module containing a leaf must be the singleton .
Consequently a nontrivial module contains no leaves, so it is a subset of with at least two vertices. But if , then the outside leaf is adjacent to and not to , so is not a module. This contradiction shows that no nontrivial module exists. By [L1], the graph is prime.
Depends on
Used by
Dependency tree · two levels
10 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
- 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)