LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-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.

A maximal acyclic spanning subgraph of a connected graph is a spanning tree

Statement

Let $G$ be a finite connected graph. If $F$ is an acyclic spanning subgraph of $G$ maximal under edge inclusion among such subgraphs, then $F$ is a spanning tree of $G$ .

Facts & Assumptions

Given: A connected graph $G$ and an edge-maximal acyclic spanning subgraph $F$ .

[F1]

The connected components of $F$ partition $V (G)$ (The connected components of a graph partition its vertex set and are its maximal connected subgraphs).

[F2]

A spanning tree is a connected acyclic spanning subgraph (Spanning trees of a graph, Trees, forests, leaves and isolated vertices).

[F3]

Connectedness supplies a path between vertices (Connected graphs and connected components defined by the existence of vertex paths).

Proof

technique · contradiction

1.1

Suppose $F$ is disconnected, and choose vertices $u, v$ in distinct components of $F$ .

assume-contraF1

1.2

A $u$ - $v$ path in $G$ has a first edge $x y$ whose endpoints lie in distinct components of $F$ .

F3F1

2.1

Adding $x y$ to $F$ cannot create a cycle, because a cycle through $x y$ would contain an $x$ - $y$ path already in $F$ , contrary to the choice of distinct components.

step 1.2

3.1

Thus $F + x y$ is a strictly larger acyclic spanning subgraph, contradicting maximality.

step 2.1

4.1

Hence $F$ is connected, and therefore it is a spanning tree.

F2discharge-contradiction∎

Depends on

Used by

A finite graph is connected if and only if it has a spanning tree Theorem

Dependency tree · two levels

31 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

Reinhard Diestel, Graph Theory, Preview Chapter 1 (standard reference, not scraped)