OpenAI reports correspondence coloring bounds for clique-free graphs
- Mathematics
For every fixed r≥4, every K_r-free graph of sufficiently large maximum degree Δ has correspondence chromatic number O_r(Δ/log Δ).
OpenAI reports correspondence coloring bounds for clique-free graphs
- Mathematics
For every fixed r≥4, every K_r-free graph of sufficiently large maximum degree Δ has correspondence chromatic number O_r(Δ/log Δ).
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
For every fixed r≥4, every K_r-free graph of sufficiently large maximum degree Δ has correspondence chromatic number O_r(Δ/log Δ).
Why it matters
If correct, resolves that coloring conjecture in the stronger correspondence-coloring setting.
What counts as progress
Do fixed-clique-free graphs admit correspondence colorings using O(Δ/log Δ) colors?
Website timeline
Publication dates and editorial changes.
OpenAI reports correspondence coloring bounds for clique-free graphs