Bipartite Exact Matching in P
The Exact Matching problem asks whether a bipartite graph with edges colored red and blue admits a perfect matching with exactly $t$ red edges. Introduced by Papadimitriou and Yannakakis in 1982, it has been in randomized polynomial time since Mulmuley-Vazirani-Vazirani (1987) while membership in P stayed open for four decades. The paper claims a deterministic polynomial-time algorithm, replacing probabilistic amplification with deterministic evaluations.
Exact FrontierDelta
Scope and record
Occurred: Apr 2, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Bipartite Exact Matching in P · Bipartite exact matching
Confidence: Not scored
Registry verification: unreviewed · preprint · candidate
Attribution
VibeMathed
registry · event recorded by
Yuefeng Du
human · human collaborator
GPT-5.4 Pro
model · ai model contributor · OpenAI
Claude Opus 4.6
model · ai model contributor · Anthropic
Aristotle
model · ai model contributor · Harmonic
Lineage and corrections
This event attributed to Yuefeng Du
This event attributed to Aristotle
This event attributed to Claude Opus 4.6
This event attributed to GPT-5.4 Pro