Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Structure of Finite Connected 2-Regular Simple Graphs as Cycle Graphs

Proved
OPG37271.two_regular_connected_iso_cycleGraph

by kmehltretter82 · Nov 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricscyclesgraph-theory

Every nonempty finite connected 222-regular simple graph HHH has at least 333 vertices and is isomorphic to the standard cycle graph C∣W∣C_{|W|}C∣W∣​ on Fin ∣W∣\mathrm{Fin}\,|W|Fin∣W∣.

Preamble
import Definitions.Def_opg37271_star_edge_coloring
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
import Mathlib.Combinatorics.SimpleGraph.Maps

universe u
namespace OPG37271
Formal statement
theorem two_regular_connected_iso_cycleGraph
    {W : Type u} [Fintype W] (H : SimpleGraph W)
    (hne : Nonempty W) (hconn : H.Connected)
    (hreg : ∀ w : W, (H.neighborSet w).encard = 2) :
    3 ≤ Fintype.card W ∧
    Nonempty (H ≃g SimpleGraph.fromRel
      (fun i j : Fin (Fintype.card W) => (i.val + 1) % Fintype.card W = j.val)) := by sorry
end OPG37271
Source
Standard structural classification of 2-factors into disjoint cycles, used in Dvořák, Mohar, and Šámal (2013), Section 4.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me