Fifty years ago, Paul Erdős and two other mathematicians came up with a graph theory problem that they thought they might solve on the spot. A team of mathematicians has finally settled it. In the ...

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 ...