Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10.10 (Euler): a connected graph has an Eulerian tour iff every node has even degree

Proved
SupplyChainTheory.euler_tour_iff

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

eulerian-walksgraph-theorytraveling-salesman

Theorem 10.10. An undirected, connected graph has an Eulerian tour, a closed walk that traverses every edge exactly once, if and only if every node has even degree.

The book omits the proof. Necessity is the observation that a closed walk enters and leaves each node equally often; sufficiency is Hierholzer's construction, splicing closed trails until all edges are used. This is the fact that turns a doubled spanning tree, or a tree plus a perfect matching on its odd nodes, into a closed walk through all the nodes, which the MST and Christofides heuristics then shortcut.

Formalization Note Stated for Mathlib simple graphs on a finite vertex type; the doubled trees of the heuristics are handled through their walks in the other items.

Preamble
import Definitions.Def_SupplyChainTheory_tsp
Formal statement
open Classical

namespace SupplyChainTheory

theorem euler_tour_iff {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V)
    [DecidableRel G.Adj] (hG : G.Connected) :
    (∀ v, Even (G.degree v)) ↔ ∃ (v : V) (p : G.Walk v v), p.IsEulerian := by sorry

end SupplyChainTheory
Source
Lawrence V. Snyder and Zuo-Jun Max Shen, Fundamentals of Supply Chain Theory, 2nd ed., Wiley 2019, DOI 10.1002/9781119584445, p. 431, Sect. 10.4.6, Theorem 10.10: 'Proof. Omitted; see, e.g., Graver and Watkins (1977)'
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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