Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6, pp. 115–118 — every connected, even, symmetric mixed graph has an Euler tour

Proved
ChinesePostman.Mixed.mixed_euler_tour

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

chinese-postmaneuler-tourmixed-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a finite mixed graph (some edges directed, some undirected; parallel edges allowed; no loops) that is

  1. connected when the directions on the edges are ignored;
  2. even: every node meets an even number of edges, regardless of direction;
  3. symmetric: every node has as many edges directed away from it as directed toward it.

Then for every node rrr there is an Euler tour of GGG starting and ending at rrr:

∃ (r=n1,e1,n2,…,el,nl+1=r) using every edge exactly once, each directed edge from its tail to its head.\exists\,(r = n_1, e_1, n_2, \dots, e_l, n_{l+1} = r) \text{ using every edge exactly once, each directed edge from its tail to its head.}∃(r=n1​,e1​,n2​,…,el​,nl+1​=r) using every edge exactly once, each directed edge from its tail to its head.

This is the main result of §6: the paper's algorithm first assigns directions to enough undirected edges and then traces the tour by its Rule. For graphs with only undirected edges it gives Euler's theorem for connected even multigraphs; for graphs with only directed edges, the classical theorem for connected balanced digraphs.

Formalization Note The tour must respect directions: a tour of the underlying undirected multigraph is not enough. The single-node graph without edges is allowed, and its one-node tour is the Euler tour.

Preamble
import Mathlib
import Definitions.Def_ChinesePostman_Mixed_Setting
Formal statement
namespace ChinesePostman.Mixed

/-- §6, pp. 115–118: every connected, even, symmetric mixed graph has an Euler tour, starting at
any prescribed node `r`, that traverses every directed edge in its direction. -/
theorem mixed_euler_tour {V E : Type} [Fintype V] [DecidableEq V] [Fintype E]
    [DecidableEq E] (G : MixedGraph V E) (hconn : G.Connected) (heven : G.IsEven)
    (hsym : G.IsSymmetric) (r : V) :
    ∃ ns es, G.IsMixedEulerTour ns es ∧ ns.head? = some r := by sorry

end ChinesePostman.Mixed
Source
Edmonds and Johnson, Matching, Euler tours and the Chinese postman, Math. Programming 5 (1973), pp. 115–118, §6 (announced p. 115, concluded p. 118: 'Thus, the rule previously given will now enable one to actually trace out an Euler tour')
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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