Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite regular bipartite graphs of positive degree have perfect matchings

Proved
OPG37364.regular_bipartite_hasPerfectMatching

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

bipartite-graphsgraph-theoryhall-theoremperfect-matchings

Let GGG be a finite simple bipartite graph, and let ddd be a positive integer. If every vertex has exactly ddd neighbors, then GGG has a perfect matching.

Equivalently, there is a map m:V(G)→V(G)m:V(G)\to V(G)m:V(G)→V(G) satisfying

v∼Gm(v)andm(m(v))=v(v∈V(G)).v\sim_G m(v)\quad\text{and}\quad m(m(v))=v\qquad(v\in V(G)).v∼G​m(v)andm(m(v))=v(v∈V(G)).

Adjacency in a simple graph excludes fixed points. Connectedness is not required. This standard consequence of Hall's marriage theorem supplies the final perfect-matching step in Lemma 5, including its degree-fourteen instance.

Preamble
import Definitions.Def_opg37364_matching_cuts

set_option autoImplicit false
Formal statement
namespace OPG37364

universe u

theorem regular_bipartite_hasPerfectMatching {V : Type u} [Finite V]
    (G : SimpleGraph V) (d : ℕ) (hd : 0 < d)
    (hreg : IsRegularOfDegree G d) (hbip : IsBipartite G) :
    HasPerfectMatching G := by sorry

end OPG37364
Source
The standard regular-bipartite consequence of Hall's Marriage Theorem, used in the final sentence of the proof of Lemma 5, Feghali--Lucke--Paulusma--Ries, Algorithmica 87 (2025), https://link.springer.com/article/10.1007/s00453-025-01318-8. Finite Hall infrastructure: https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Combinatorics/Hall/Finite.lean
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 2026

    Confirmed by the mission captain (proposal self-audit).

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