Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Deleting a P3 from a cubic 3-connected graph leaves a connected residual graph

Proved
CubicP3Partition.cubic_three_connected_eraseP3_connected

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

connectivitycubic-graphsgraph-theoryp3-factor

Let GGG be a finite cubic graph that remains connected after deletion of any set of at most two vertices. For every displayed path a−b−ca-b-ca−b−c in GGG, delete a,b,ca,b,ca,b,c and take the induced graph on the remaining vertices. The resulting graph is connected.

This structural lemma shows that a single P3P_3P3​ deletion cannot create multiple residual components under cubic three-vertex-connectivity. It does not assert that the residual graph has a P3P_3P3​-factor.

Preamble
import Mathlib
import Definitions.Def_cubic_p3_partition_models
Formal statement
namespace CubicP3Partition

/-- Deleting the three vertices of any displayed P3 from a finite cubic three-vertex-connected graph leaves a connected induced residual graph. -/
theorem cubic_three_connected_eraseP3_connected
    {V : Type} [DecidableEq V] [Fintype V]
    {G : SimpleGraph V} [DecidableRel G.Adj]
    (hC : Cubic G) (h3 : ThreeVertexConnected G) (L : P3Path G) :
    (eraseP3 G L).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