Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree-2 Vertex Suppression Preserves 3-Regularity and Bridgelessness

Proved
OPG37271.suppress_deg2_bridgeless_cubic

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

combinatoricscubic-graphsgraph-theory

Let GGG be a finite bridgeless simple graph in which every vertex has degree 222 or 333, with no adjacent degree-222 vertices, no triangle containing a degree-222 vertex, and no 444-cycle with opposite degree-222 vertices. Then suppressing all degree-222 vertices produces a simple, 333-regular, bridgeless graph G′G'G′ on the degree-333 vertices of GGG.

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

universe u
namespace OPG37271
Formal statement
theorem suppress_deg2_bridgeless_cubic
    {V : Type u} [Fintype V] (G : SimpleGraph V)
    (hdeg : ∀ v : V, (G.neighborSet v).encard = 2 ∨ (G.neighborSet v).encard = 3)
    (hbridge : ∀ u v : V, G.Adj u v → (G.deleteEdges {s(u, v)}).Reachable u v)
    (hnoadj2 : ∀ u v : V, G.Adj u v →
      ¬ ((G.neighborSet u).encard ≤ 2 ∧ (G.neighborSet v).encard ≤ 2))
    (hnotri2 : ∀ x y z : V, G.Adj x z → G.Adj y z → G.Adj x y →
      ¬ (G.neighborSet z).encard ≤ 2)
    (hno4cyc2 : ∀ z₁ z₂ x y : V, z₁ ≠ z₂ → x ≠ y →
      (G.neighborSet z₁).encard = 2 → (G.neighborSet z₂).encard = 2 →
      G.Adj x z₁ → G.Adj y z₁ → G.Adj x z₂ → G.Adj y z₂ → False) :
    ∃ G' : SimpleGraph {v : V // (G.neighborSet v).encard = 3},
      (∀ u w : {v : V // (G.neighborSet v).encard = 3},
        G'.Adj u w ↔ u ≠ w ∧
          (G.Adj u.1 w.1 ∨ ∃ z : V, (G.neighborSet z).encard = 2 ∧ G.Adj u.1 z ∧ G.Adj w.1 z)) ∧
      (∀ u : {v : V // (G.neighborSet v).encard = 3},
        (G'.neighborSet u).encard = 3) ∧
      (∀ u w : {v : V // (G.neighborSet v).encard = 3},
        G'.Adj u w → (G'.deleteEdges {s(u, w)}).Reachable u w) := by sorry
end OPG37271
Source
Dvořák, Mohar, and Šámal, Star chromatic index, J. Graph Theory 72 (2013), 313–326 (arXiv:1011.3376), 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