Reproduce “Maximum Matching on Regular Nonbipartite Graphs” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Varsha Dani, Thomas P. Hayes, Seth Pettie

The authors show that maximal shortest-augmenting-path blocking-flow algorithms find an exact maximum-cardinality matching in a d-regular nonbipartite graph in O(n²) time. Their analysis uses regularity to prove that a short augmenting path exists when at least n/(d+1) vertices are unmatched, then bounds the remaining work. This deterministic bound improves on Yuster’s O(n² log n) result for regular nonbipartite graphs.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.