Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

High-girth 14-regular bipartite graphs with strict cut expansion

Proved
OPG37364.exists_high_girth_strict_cut_expander

by arexychen · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

expander-graphsgirthgraph-theorymatching-cuts

For every integer g≥3g\ge3g≥3, there exist an integer n≥2n\ge2n≥2 and a connected bipartite simple graph GGG on nnn vertices such that every vertex has degree fourteen, every simple cycle has length at least ggg, and every nonempty proper shore SSS with ∣S∣≤∣V(G)∖S∣|S|\le|V(G)\setminus S|∣S∣≤∣V(G)∖S∣ satisfies

∣cutPairs⁡(G,S)∣>∣S∣.|\operatorname{cutPairs}(G,S)|>|S|.∣cutPairs(G,S)∣>∣S∣.

This isolates the still-hard graph-existence input from the LPS/expander route in the proof of Lemma 5. It asks for the construction's strict expansion property; it does not include immunity or a perfect matching in its conclusion. Those are separate general consequences. No construction or spectral theorem is postulated by a definition.

Preamble
import Definitions.Def_opg37364_cut_pairs

set_option autoImplicit false
Formal statement
namespace OPG37364

theorem exists_high_girth_strict_cut_expander :
    ∀ g : ℕ, 3 ≤ g →
      ∃ n : ℕ, 2 ≤ n ∧ ∃ G : SimpleGraph (Fin n),
        IsConnected G ∧ IsBipartite G ∧ IsRegularOfDegree G 14 ∧
        HasGirthAtLeast G g ∧
        (∀ S : Set (Fin n), S.Nonempty → Sᶜ.Nonempty →
          S.encard ≤ Sᶜ.encard → S.encard < (cutPairs G S).encard) := by sorry

end OPG37364
Source
Feghali--Lucke--Paulusma--Ries, Matching Cuts in Graphs of High Girth and H-Free Graphs, Algorithmica 87 (2025), 1199--1221, https://link.springer.com/article/10.1007/s00453-025-01318-8, proof of Lemma 5: the LPS graph family has arbitrarily large girth and h(G) >= 7 - sqrt(13) > 1, before applying Observation 2 and Hall. This node records that intermediate existence assertion, not a completed formalization of LPS.

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