Theorem SimpleGraph.Connected.card_vert_le_card_edgeSet_add_one

Modification history

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.card_vert_le_card_edgeSet_add_oneView on Github →