Preprint
Jul 2026
Graph k-Coloring in Average Sublinear Time
The main result shows that the exact average-case complexity of this fundamental problem is $\Theta(nk)$ for every $k \leq n^{c'}$ and some $c'\in (0, 1)$, and reveals the average sublinear nature of $k$-colorability: the average-case complexity is linear in $n$, and thus sublinear in the size of the input.
Cassandra Marcussen, Edward Pyne, R. Rubinfeld et al.
· 0 citations