A forest with |V|-1 edges is connected (spanning tree criterion)
ProvedClassicalGaps.isAcyclic_edges_eq_card_sub_one_imp_connectedFor a finite simple graph on vertex set : if is acyclic (a forest) and has exactly edges, then is connected (hence a spanning tree). This is the standard graph-theoretic fact that a forest achieves the maximum possible edge count for an acyclic graph on vertices exactly when it is a single tree, used as a lemma in the Kirchhoff matrix-tree theorem decomposition (see ClassicalGaps.orientedIncMatrix_submatrix_det_eq_spanningTree_indicator, which needs it to characterize when an edge-subset forms a spanning tree).
Preamble
import Mathlib
Formal statement
namespace ClassicalGaps
theorem isAcyclic_edges_eq_card_sub_one_imp_connected
{V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
(hG : G.IsAcyclic) (hcard : Nat.card G.edgeSet + 1 = Nat.card V) :
G.Connected := by sorry
end ClassicalGaps