Reproduce “Improved SDP-Based Algorithm for Coloring 3-Colorable 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

Nikhil Bansal, Neng Huang, Euiwoong Lee

The authors present a polynomial-time algorithm that colors every n-vertex 3-colorable graph with O(n^0.19539) colors, without access to its hidden 3-coloring. The hybrid combines SDP-based analysis of third-level neighborhoods and a new vector 5/2-coloring with a combinatorial method for dense graphs. This improves the previous O(n^0.19747) bound; it is a theoretical worst-case guarantee, not an empirical result.

Summary by alphaXiv.

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