Preprint
Aug 2026
Streaming Hypergraph Coloring via Palette Sparsification
A randomized one-pass insertion-only algorithm that colors an $n$-vertex $k$-uniform hypergraph of maximum degree $\Delta$ with $O(\Delta^{1/(k-1)})$ colors using $\widetilde O_k(n)$ bits of working memory is given.
Artur Czumaj, Pan Peng, Rui Shi et al.
· 0 citations