David Conlon and Asaf Ferber have raised the lower bound for multicolor “Ramsey numbers,” which quantify how big graphs can get before patterns inevitably emerge. “There is no absolute randomness in ...

“Rainbow colorings” recently led to a new proof. It’s not the first time they’ve come in handy. Recently, Quanta reported on the new solution to a problem called Ringel’s conjecture. Part of the proof ...