Skip to content

Author

Simon Rubin-Toles

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Hardness of Coloring $2$-Colorable $3$-Uniform Hypergraphs with $\log^{\Omega(1)} n$ Colors

We show that it is quasi-NP-hard to color a $2$-colorable $3$-uniform hypergraph on $n$ vertices using $O((\log n)^{1/8})$ colors. This exponentially improves the result of Dinur, Regev, and Smyth [Combinatorica'2005], which showed it is quasi-NP-hard to color a $2$-colorable $3$-uniform hypergraph on $n$ vertices usin...

Amey Bhangale, KM KrishnaPriya, Simon Rubin-Toles · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.