P12 p3factor to center hall
ProvedCubicP3Partition.p12_p3Factor_to_center_hallgraph-theoryhall-theoremp3-factor
A P3 factor supplies a center set satisfying the two-fold Hall inequalities.
$$|A|\le |N_{\mathrm{dup}}(A)|.
This isolates one reusable step in the exact duplicated-center Hall characterization of finite non-induced -factors. It is an auxiliary theorem and does not assert the open root P3-factor conjecture.
Preamble
import Definitions.Def_cubic_p3_partition_center_hall_aux
Formal statement
namespace CubicP3Partition
universe u
variable {V : Type u}
theorem p12_p3Factor_to_center_hall [Fintype V] {G : SimpleGraph V} :
Nonempty (P3Factor G) →
∃ C : Finset V, p12CenterSize C ∧ p12CenterHall G C := by sorry
end CubicP3PartitionSource
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.