Online Graph Coloring: Competitive Ratios Separating Randomized and Deterministic Algorithms
cs.DS, cs.DM, math.CO
Submitted: 2026-11-10
Updated: 2026-11-10
Code: https://github.com/openai/math
Terminology
Sources
- Coloring small locally sparse degenerate graphs and related problems
- Online Graph Coloring for $k$-Colorable Graphs
- New bounds for online coloring three-colorable graphs
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time