Mathematics · the experiment
Freeze the colours
A random network, a box of colours, links added one at a time until no colouring works. Four questions, from beginner to expert, on the proof that this breaking point settles.
1 · Say what is proved
Beginner
What does the new proof establish for every number of colours from three up?
2 · Count the fatal links
A colourable graph has 10 dots. Exactly four of them form a frozen class: every valid colouring gives them the same colour. No other dot is frozen with any other.
A new link joins two distinct dots chosen at random.
Intermediate
What is the chance that this link makes the graph uncolourable?
3 · Explain why no dot is frozen alone
Expert
Why can no single dot be forced to one particular colour in a colourable graph?
4 · Find what 1999 left open
Achlioptas and Friedgut proved that, for each size n, the switch happens in a window around a critical value that depends on n, and that this window shrinks to nothing.
Expert
What could still go wrong before the new proof?
Colours frozen
—