Theorem SimpleGraph.Connected.exists_isTree_le

Modification history

2026-02-13 23:15
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
feat(Combinatorics/SimpleGraph/Acyclic): every graph has a spanning forest (#33118) …
Modified SimpleGraph.Connected.exists_isTree_leView on Github →
2025-03-28 14:56
Mathlib/Combinatorics/SimpleGraph/Acyclic.lean
feat(SimpleGraph): a connected graph with n - 1 edges is a tree (#23399) …
Added SimpleGraph.Connected.exists_isTree_leView on Github →