Reproduce “Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3” 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
Ryoma Aoshima, Takashi Horiyama, Atsuki Nagao, Fumiya Sakamoto, Hibiki Sato, Kazuhisa Seto, Karin Umebayashi
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.