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.
has , so König's equality needs bipartiteness
Counterexample
In the triangle , every matching has at most one edge, while every vertex cover has at least two vertices. Hence .
Facts & Assumptions
Given: The complete graph on three vertices.
König's equality applies to finite bipartite graphs (König's theorem: for every finite bipartite graph).
Verification
Verification technique: direct.
Any two edges of share a vertex, so a matching has at most one edge; any one edge gives .
Deleting one vertex leaves an edge, so one vertex is not a cover; two vertices cover all edges, giving .
Thus , and [L1] shows precisely why this does not contradict König's theorem: is not bipartite.
This triangle is a finite witness that bipartiteness is a necessary hypothesis for the equality.
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: 13 results over 6 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.