Q3 side port card at least two
ProvedR03SP06.q3_side_port_card_at_least_twoconnectivitycubic-graphsgraph-theorytriangles
Every side of a residual cut must use at least two vertices of the three-vertex deleted set. A side is closed after the residual cut vertex x and the deleted set T are removed.
$$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 q3_side_port_card_at_least_two
{G : SimpleGraph V} [DecidableRel G.Adj] {A B T : Finset V} {x : V}
(hA : A.Nonempty) (hB : B.Nonempty)
(hAB : Disjoint A B)
(hAT : Disjoint A T) (hBT : Disjoint B T)
(hxA : x ∉ A) (hxB : x ∉ B) (hxT : x ∉ T)
(hclosed : ∀ ⦃u v : V⦄, u ∈ A → G.Adj u v → v ∈ A ∪ T ∪ {x})
(hT : T.card = 3)
(h2 : ∀ S : Finset V, S.card ≤ 2 →
(G.induce {v : V | v ∉ S}).Connected) :
2 ≤ (T.filter (fun t => ∃ u ∈ A, G.Adj u t)).card := 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.