Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Existence of a 1-Regular Spanning Subgraph in Finite Bridgeless Cubic Graphs

Proved
OPG37271.exists_one_regular_of_bridgeless_cubic

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

combinatoricsgraph-theorymatching

Every finite bridgeless 333-regular simple graph GGG contains a 111-regular spanning subgraph M≤GM \le GM≤G (whose complement G∖E(M)G \setminus E(M)G∖E(M) is a 222-factor).

Preamble
import Definitions.Def_opg37271_star_edge_coloring
import Mathlib.Combinatorics.SimpleGraph.DeleteEdges

universe u
namespace OPG37271
Formal statement
theorem exists_one_regular_of_bridgeless_cubic
    {V : Type u} [Fintype V] (G : SimpleGraph V)
    (hcubic : ∀ v : V, (G.neighborSet v).encard = 3)
    (hbridgeless : ∀ u v : V, G.Adj u v → (G.deleteEdges {s(u, v)}).Reachable u v) :
    ∃ M : SimpleGraph V, M ≤ G ∧ ∀ v : V, (M.neighborSet v).encard = 1 := by sorry
end OPG37271
Source
Julius Petersen, Acta Mathematica 15 (1891), 193–220; used in Dvořák, Mohar, and Šámal (2013), Proof of Theorem 4.1(a).

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