Reproduce “A Low-Diameter Nash-Williams--Tutte Theorem” 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
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai, Ting-An Wu
The authors construct k edge-disjoint spanning trees in a simple graph that simultaneously have diameter O(n/δ) and O((n/δ)log(δ+1)) internal vertices. The graph must satisfy the Nash-Williams–Tutte partition condition: every partition into r nonempty parts has at least k(r−1) crossing edges. Their construction rearranges edges across trees, and a randomized algorithm computes them in expected Õ(n^5) time. The guarantee requires simplicity.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.