🖼️7474k-Coloring is Faster than Computing the Chromatic NumberHacker News·about 2 months ago#GEmroyVa#arxiv#coloring#list#zamir#view#algorithm+2 more🧰Tag tools✨Add tagWe prove that $k$-coloring on $n$-vertex graphs has a randomized algorithm running in time $(2-\varepsilon_k)^n$, where $\varepsilon_k>0$ for every fixed $k$.… Read more15s0Read later0Read More
