Theorem SimpleGraph.card_connectedComponent_eq_one_iff

Modification history

2026-10-17 16:48

Mathlib/Combinatorics/SimpleGraph/Connectivity/Connected.lean

feat(Combinatorics/SimpleGraph/Acyclic): a graph is a tree iff it's acyclic and has exactly `n - 1` edges (#34910)

Added SimpleGraph.card_connectedComponent_eq_one_iff View on Github →