Closed side induced not connected
ProvedR03SP06.closed_side_induced_not_connectedconnectivitycubic-graphsgraph-theorytriangles
Reusable auxiliary theorem closed_side_induced_not_connected from the verified P3-factor development.
$$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 closed_side_induced_not_connected
{G : SimpleGraph V} {A B S : Finset V}
(hA : A.Nonempty) (hB : B.Nonempty)
(hAB : Disjoint A B) (hAS : Disjoint A S) (hBS : Disjoint B S)
(hclosed : ∀ ⦃u v : V⦄, u ∈ A → G.Adj u v → v ∈ A ∪ S) :
¬ (G.induce {v : V | v ∉ S}).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.