Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

P3-factors are equivalent to duplicated-center Hall systems

Proved
CubicP3Partition.p3Factor_iff_center_hall

by hao jia · Sep 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgraph-theoryhall-theoremp3-factor

Let GGG be a finite simple graph. Then GGG has a spanning non-induced P3P_3P3​-factor if and only if there is a set C⊆V(G)C\subseteq V(G)C⊆V(G) with 3∣C∣=∣V(G)∣3|C|=|V(G)|3∣C∣=∣V(G)∣ such that every subset A⊆CA\subseteq CA⊆C has at least 2∣A∣2|A|2∣A∣ neighbours outside CCC:

G has a P3-factor⟺∃C,  3∣C∣=∣V(G)∣ and ∣N(A)∖C∣≥2∣A∣ for all A⊆C.G\text{ has a }P_3\text{-factor}\quad\Longleftrightarrow\quad\exists C,\;3|C|=|V(G)|\text{ and }|N(A)\setminus C|\ge 2|A|\text{ for all }A\subseteq C.G has a P3​-factor⟺∃C,3∣C∣=∣V(G)∣ and ∣N(A)∖C∣≥2∣A∣ for all A⊆C.

The equivalence turns a P3P_3P3​-factor into its set of middle vertices and, conversely, realizes two leaf slots per center through Hall's theorem. It gives an exact finite matching characterization and does not assume cubicity or connectivity.

Formalization Note The predicate p12CenterHall is the two-fold Hall condition on duplicated center slots.

Preamble
import Definitions.Def_cubic_p3_partition_models
import Definitions.Def_cubic_p3_partition_center_hall
Formal statement
namespace CubicP3Partition

universe u

/-- Exact characterization of finite non-induced P3-factors by a one-third-size center set satisfying the duplicated-center Hall inequalities. -/
theorem p3Factor_iff_center_hall
    {V : Type u} [Fintype V] {G : SimpleGraph V} :
    Nonempty (P3Factor G) ↔
      ∃ C : Finset V, p12CenterSize C ∧ p12CenterHall G C := by sorry

end CubicP3Partition
Source
Derived structural 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; the exact Hall characterization is a project-derived auxiliary theorem.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me