Cubic triangle residual no cut vertex
ProvedR03SP06.cubic_triangle_residual_no_cut_vertexconnectivitycubic-graphsgraph-theorytriangles
Integrated conditional q=3 reduction for a triangle deletion in a cubic 3-vertex-connected graph. The residual after also deleting any vertex is connected once at least six root vertices are present.
$$G-V(C_3)\text{ satisfies the stated residual-connectivity conclusion}.
This isolates one reusable port-counting or residual-connectivity step for deleting a triangle from a cubic three-vertex-connected graph. It is an auxiliary theorem and does not assert the open root P3-factor conjecture.
Preamble
import Mathlib import Definitions.Def_cubic_p3_partition_models
Formal statement
namespace R03SP06
open CubicP3Partition
variable {V : Type} [Fintype V] [DecidableEq V]
theorem cubic_triangle_residual_no_cut_vertex
{G : SimpleGraph V} [DecidableRel G.Adj]
(hC : Cubic G) (h3 : ThreeVertexConnected G)
(hcard : 6 ≤ Fintype.card V)
{a b c x : V}
(hab : G.Adj a b) (hbc : G.Adj b c) (hca : G.Adj c a)
(hx : x ≠ a ∧ x ≠ b ∧ x ≠ c) :
(G.induce {v : V | v ≠ a ∧ v ≠ b ∧ v ≠ c ∧ v ≠ x}).Connected := by sorry
end R03SP06Source
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.