is_unicyclic
def
A simple graph G on a finite vertex set V is unicyclic if G is connected and its number of edges equals its number of vertices.
Statement
def is_unicyclic {V : Type*} [Fintype V] (G : SimpleGraph V) : Prop
- Defined in
- Harary, Graph Theory (1969), Chapter 4
- Verified
- 27 Oct 2026
- Axioms
- none listed
Read back from the Lean
For a finite type V and a simple graph G on V, is_unicyclic G is defined as the proposition that G is connected and the number of edges of G (G.edgeFinset.card) equals the number of vertices in V (Fintype.card V).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A finite simple graph is unicyclic if it is connected and its number of edges equals its number of vertices. -/ def is_unicyclic {V : Type*} [Fintype V] (G : SimpleGraph V) : Prop := open scoped Classical in G.Connected ∧ G.edgeFinset.card = Fintype.card V