Bipartite Exact Matching in P
arXiv:2604.01571v1 Announce Type: cross Abstract: 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, the problem has resisted deterministic polynomial-time algorithms for over four decades, despite admitting a randomized solution via the Schwartz-Zippel lemma since 1987. We prove the Affine-Slice Nonvanishing Conjecture (ASNC) for all bipartite braces and give a deterministic O(n^6) algorithm for Exact Matching on all bipartite graphs. The algorithm follows via the tight-cut decomposition, which reduces the decision problem to brace blocks. The proof proceeds by structural induction on McCuaig's brace decomposition. We establish the McCuaig exceptio
View PDF HTML (experimental)
Abstract: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, the problem has resisted deterministic polynomial-time algorithms for over four decades, despite admitting a randomized solution via the Schwartz-Zippel lemma since 1987. We prove the Affine-Slice Nonvanishing Conjecture (ASNC) for all bipartite braces and give a deterministic O(n^6) algorithm for Exact Matching on all bipartite graphs. The algorithm follows via the tight-cut decomposition, which reduces the decision problem to brace blocks. The proof proceeds by structural induction on McCuaig's brace decomposition. We establish the McCuaig exceptional families, the replacement determinant algebra, and the narrow-extension cases (KA, J3 to D1). For the superfluous-edge step, we introduce two closure tools: a matching-induced Two-extra Hall theorem that resolves the rank-(m-2) branch via projective-collapse contradiction, and a distinguished-state q-circuit lemma that eliminates the rank-(m-1) branch entirely by showing that any minimal dependent set containing the superfluous state forces rank m-2. The entire proof has been formally verified in the Lean 4 proof assistant.
Subjects:
Discrete Mathematics (cs.DM); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
Cite as: arXiv:2604.01571 [cs.DM]
(or arXiv:2604.01571v1 [cs.DM] for this version)
https://doi.org/10.48550/arXiv.2604.01571
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Yuefeng Du [view email] [v1] Thu, 2 Apr 2026 03:36:59 UTC (45 KB)
Sign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
announceassistantarxiv
How AI and Alternative Data Are Finally Making Germany's Hidden Champions Accessible to Global Investors
PRESS RELEASE For Immediate Release How AI and Alternative Data Are Finally Making Germany's Hidden Champions Accessible to Global Investors MittelstandDecoded.com launches with an AI-powered analytical framework that mines Handelsregister filings, patent databases, and Bundesanzeiger disclosures to surface undervalued German mid-caps before institutional coverage arrives Ratingen, April 2026 — For decades, the problem with investing in Germany's Mittelstand has not been a lack of quality companies. It has been a lack of accessible, machine-readable, English-language intelligence about them. That changes now. MittelstandDecoded.com launches today as a new specialist financial portal combining institutional-grade human analysis with AI-assisted data processing to make Germany's MDAX, SDAX,
What Self-Hosting OpenClaw Actually Costs (It's Not Just the VPS)
Every deployment guide says self-hosting OpenClaw costs $5-20/mo. I believed that too, until I started tracking where my time actually went. The VPS was the cheapest part of the whole operation. What Everyone Budgets You find a deployment guide. It walks you through spinning up a VPS, pulling the Docker image, setting up a reverse proxy. At the end, you do the math: maybe $7 on Hetzner, $48 if you want DigitalOcean's SLA. Add a domain, Let's Encrypt, your own API keys. Call it $20-100/mo depending on how fancy you get. For reference, here's what a 4 vCPU / 8 GB instance actually costs in 2026: Provider Monthly The catch Contabo ~$5 Oversold shared vCPUs. Performance varies. OVH ~$6.50 Free daily backups. Honest value. Hetzner ~$9 No SLA. US regions get 1 TB transfer, not 20 TB. Price incre
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Products
Building eCourses: A Community‑First LMS SaaS (and Why You Should Build in Public)
I’m building a Learning Management System SaaS called eCourses , designed specifically for small communities and independent educators who feel priced out or over‑engineered by existing platforms. This post is the first in a series where I’ll walk through the architecture, decisions, and “lessons learned” from shipping an LMS from scratch — in public, open source, and on a tight budget. Why I Built eCourses Most LMS platforms are either: Too expensive for solo creators and small communities. Too complex for simple “course + modules + lessons + live sessions” workflows. Too rigid to let instructors experiment with their own teaching style. I wanted something that: Feels native to communities (not just single instructors). Scales technically and financially under $10/month at reasonable load
Qodo vs Cody (Sourcegraph): AI Code Review Compared (2026)
Quick Verdict Qodo and Sourcegraph Cody are both AI tools for software teams, but they solve fundamentally different problems. Qodo is a code quality platform - it reviews pull requests automatically, finds bugs through a multi-agent architecture, and generates tests to fill coverage gaps without being asked. Cody is a codebase-aware AI coding assistant - it understands your entire repository and helps developers navigate, generate, and understand code through conversation and inline completions. Choose Qodo if: your team needs automated PR review that runs on every pull request without prompting, you want proactive test generation that closes coverage gaps systematically, you work on GitLab or Azure DevOps alongside GitHub, or the open-source transparency of PR-Agent matters to your organ
XYRONIX
🌌 X Y R O N I X // NEURAL CONCEPTUALIZATION MATRIX // v1.0.0 // "Pure, decentralized creation space. Infinite boundaries. Zero latency." XYRONIX is a high-performance, infinite-plane rendering engine designed for rapid ideation, tactical diagramming, and free-form vector sketching. Operating entirely within the computational bounds of your browser, XYRONIX provides a secure, lightweight environment to map out your digital universe without relying on external server telemetry. 🚀 LIVE DEPLOYMENT: ESTABLISH UPLINK XYRONIX requires zero installation, zero server configurations, and zero package managers. It is hosted directly on the global grid via GitHub Pages. 🔗 Access the XYRONIX Interface Here THE UI To Engage Systems: Initialize: Click the uplink above to open the matrix in your prefer
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!