Breaking the $2^n$ barrier for graph $k$-coloring — mentioned by in_between

Sat, 08 Aug 2026 19:43:56 GMT

Also see my concurrent result: https://arxiv.org/abs/2607.27159. Quantitatively, mine is slightly better :) my \eps_k is something like 1/2^2^2^k, Zamir gets a tower of height O(k).

Paper and discussion history. A mention is not an endorsement.

Breaking the $2^n$ barrier for graph $k$-coloring — HN submission

Sat, 08 Aug 2026 17:17:43 GMT

Breaking the 2^n Barrier for Graph k-Coloring

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Breaking the $2^n$ barrier for graph $k$-coloring · HackerPapers discussions

Breaking the $2^n$ barrier for graph $k$-coloring — mentioned by in_between

Breaking the $2^n$ barrier for graph $k$-coloring — HN submission