Q3 two side port budget impossible
ProvedR03SP06.q3_two_side_port_budget_impossibleconnectivitycubic-graphsgraph-theorytriangles
Two disjoint port sets of size at least two cannot fit in a three-vertex deleted set.
$$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_two_side_port_budget_impossible
{S P Q : Finset V}
(hS : S.card = 3)
(hP : 2 ≤ P.card) (hQ : 2 ≤ Q.card)
(hPQ : Disjoint P Q) (hsubset : P ∪ Q ⊆ S) : False := 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.