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 line graph whose vertices are the edges of the original graph and whose adjacency records a shared endpoint
Definition
For a graph , its line graph has vertex set . Distinct vertices are adjacent in exactly when the edges and of share an endpoint, that is, when .
Because is finite and adjacency is recorded as a set of two-element subsets of , the line graph is again a finite simple graph (A finite simple graph is a finite vertex set together with a set of two-element vertex subsets). Incidence in has become adjacency in .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 10 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- R. Diestel, Graph Theory, Chapter 1 preview (standard reference, not scraped)