What's up in
Researchers have proved a special case of the Erdős-Hajnal conjecture, which shows what happens in graphs that exclude anything resembling a pentagon.
At 21, Ashwin Sah has produced a body of work that senior mathematicians say is nearly unprecedented for a college student.
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.
We finally know how big a set of numbers can get before it has to contain a pattern known as a “polynomial progression.”
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.
Get highlights of the most important news delivered to your email inbox