Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Triangle deletion in a divisible-order cubic 3-connected graph leaves a 2-connected residual

Proved
CubicP3Partition.cubic_triangle_residual_two_connected

by hao jia · Sep 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

connectivitycubic-graphsgraph-theorytriangles

Let GGG be a finite cubic three-vertex-connected graph whose order is divisible by three, and let abcabcabc be a triangle. After deleting a,b,ca,b,ca,b,c, the induced residual graph is connected. Moreover, deleting any one additional residual vertex still leaves it connected. Thus the triangle residual has no cut vertex in the explicit deletion-connectivity sense used here.

The theorem is a structural reduction for studying P3P_3P3​-factors; it does not itself construct such a factor.

Preamble
import Mathlib
import Definitions.Def_cubic_p3_partition_models
Formal statement
namespace CubicP3Partition

/-- In a finite cubic three-vertex-connected graph of order divisible by three, deleting a triangle leaves a connected residual with no cut vertex. -/
theorem cubic_triangle_residual_two_connected
    {V : Type} [Fintype V] [DecidableEq V]
    {G : SimpleGraph V} [DecidableRel G.Adj]
    (hC : Cubic G) (h3 : ThreeVertexConnected G)
    (hdiv : 3 ∣ Fintype.card V)
    {a b c : V}
    (hab : G.Adj a b) (hbc : G.Adj b c) (hca : G.Adj c a) :
    (G.induce {v : V | v ≠ a ∧ v ≠ b ∧ v ≠ c}).Connected ∧
      ∀ x : V, x ≠ a ∧ x ≠ b ∧ x ≠ c →
        (G.induce {v : V | v ≠ a ∧ v ≠ b ∧ v ≠ c ∧ v ≠ x}).Connected := by sorry

end CubicP3Partition
Source
Derived auxiliary theorem for the Prove2me mission ‘P3-Partitions of Cubic 3-Connected Graphs (OPG-46613)’, https://prove2.me/missions/P3-Partitions%20of%20Cubic%203-Connected%20Graphs%20%28OPG-46613%29; background: A. Kelmans, ‘Packing 3-vertex paths in cubic 3-connected graphs’, arXiv:0801.1239.

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