Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Three vertex connected separator card ge three

Proved
R03ThreeVertexSeparatorCandidate.three_vertex_connected_separator_card_ge_three

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

connectivitygraph-theoryseparatorsvertex-boundary

In a finite simple graph satisfying the project's three-vertex-connectivity predicate, every separator separating two nonempty sides has at least three vertices.

$$|N(Q)\setminus Q|\ge 3.

This isolates one reusable separator or external-boundary statement in a finite three-vertex-connected graph. It is an auxiliary theorem and does not assert the open root P3-factor conjecture.

Preamble
import Definitions.Def_cubic_p3_partition_models
import Definitions.Def_cubic_p3_partition_external_boundary
Formal statement
namespace R03ThreeVertexSeparatorCandidate

universe u
variable {V : Type u} [Fintype V] [DecidableEq V]

open CubicP3Partition

theorem three_vertex_connected_separator_card_ge_three
    (G : SimpleGraph V) [DecidableRel G.Adj]
    (hG : ThreeVertexConnected G)
    (Q N R : Finset V)
    (hQN : Disjoint Q N)
    (hQR : Disjoint Q R)
    (hNR : Disjoint N R)
    (hcover : Q ∪ N ∪ R = Finset.univ)
    (hQ : Q.Nonempty)
    (hR : R.Nonempty)
    (hno : ∀ q ∈ Q, ∀ r ∈ R, ¬ G.Adj q r) :
    3 ≤ N.card := by sorry

end R03ThreeVertexSeparatorCandidate
Source
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.

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