OpenResearch

Reproduce “On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs” on OpenResearch

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

Download for macOS

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

About this paper

Felicia Lucke, Daniël Paulusma, Bernard Ries

Read on alphaXiv

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