What's up in
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.
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.
A powerful technique called SAT solving could work on the notorious Collatz conjecture. But it’s a long shot.
Two mathematicians have proved the first leg of Paul Erdős’ all-time favorite problem about number patterns.
A major advance toward solving the 60-year-old sunflower conjecture is shedding light on how order begins to appear as random systems grow in size.