Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 365 — the edge dominating set problem for bipartite graphs with maximum degree 3 is in NP

Proved
EdgeDomSets.NPC.edsBip3_inNP

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

np-completenessp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

The edge dominating set problem for bipartite graphs with maximum degree 3 belongs to NP:

EDSbip,3∈NP,\mathrm{EDS}_{\mathrm{bip},3}\in\mathrm{NP},EDSbip,3​∈NP,

i.e. there is a verifier running in polynomially many Turing-machine steps, with polynomially bounded certificates, that accepts some certificate for xxx exactly when x∈EDSbip,3x\in\mathrm{EDS}_{\mathrm{bip},3}x∈EDSbip,3​.

This is the membership half of THEOREM 2; the paper's recipe (p. 365) requires it but gives no argument.

Formalization Note NP is CookLevin.InNP.

Differences from the source:

  • encoding: P ∈ NP → CookLevin.InNP edsBip3Lang; reason: Cook's and Karp's notion, on the published CookLevin machine model
  • reading: bipartite graphs with maximum degree 3; a positive integer k → simple graph with Colorable 2, every degree ≤ 3, and 1 ≤ k; reason: paper.md reading 6
Preamble
import Mathlib
import Definitions.Def_EdgeDomSets_NPC_Problems
Formal statement
namespace EdgeDomSets.NPC

theorem edsBip3_inNP : CookLevin.InNP edsBip3Lang := by sorry

end EdgeDomSets.NPC
Source
Yannakakis, Gavril, Edge dominating sets in graphs, SIAM J. Appl. Math. 38(3) (1980) 364–372, p. 365, §2 ("it is enough to prove that P ∈ NP …")
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

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