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.
Every edge of a connected graph lies in every spanning tree
False Statement
Every edge of a connected graph belongs to every spanning tree of that graph.
Facts & Assumptions
Given: The claimed universal assertion about connected graphs and their spanning trees.
The triangle has distinct spanning trees obtained by deleting different edges (A connected graph with two distinct spanning trees).
An edge outside a spanning tree closes a fundamental cycle (Every edge outside a spanning tree determines a unique fundamental cycle).
A spanning tree need only use a subset of the graph's edges (Spanning trees of a graph).
Refutation
In , fix an edge and delete it. The remaining two edges form a spanning tree.
This spanning tree omits ; adding back closes the triangle as its fundamental cycle.
Hence an edge of a connected graph need not lie in every spanning tree.
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: 19 results over 9 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
- Reinhard Diestel, Graph Theory, Preview Chapter 1 (standard reference, not scraped)
- ISI Bangalore discrete mathematics notes, Minimal spanning trees (standard reference, not scraped)