Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Not reachable across partition

Proved
R03ThreeVertexSeparatorCandidate.not_reachable_across_partition

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

connectivitygraph-theoryseparatorsvertex-boundary

A walk cannot move from one side of a partition to the other when no edge joins the two sides.

$$|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 not_reachable_across_partition
    {U : Type u} (H : SimpleGraph U)
    (A B : Set U)
    (hdisj : Disjoint A B)
    (hpart : ∀ x, x ∈ A ∨ x ∈ B)
    (hno : ∀ {x y}, x ∈ A → y ∈ B → ¬ H.Adj x y)
    {u v : U} (hu : u ∈ A) (hv : v ∈ B) :
    ¬ H.Reachable u v := 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