no. 17 · Wednesday 18 November 2026
A Proof of the Achlioptas-Friedgut Convergence Conjecture
Abstract
For every fixed integer $q\ge3$, we show that the $q$-colourability transition in a sparse random graph takes place at a limiting edge density, thus proving the Achlioptas-Friedgut convergence conjecture. The proof adapts the argument we recently introduced to settle the satisfiability conjecture.
- comments
- Comments are welcome!
- fields
- Probability, Combinatorics