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.
Avi Wigderson and László Lovász won for their work developing complexity theory and graph theory, respectively, and for connecting the two fields.
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.
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory.
Computer scientists established a new boundary on computationally verifiable knowledge. In doing so, they solved major open problems in quantum mechanics and pure mathematics.
Get highlights of the most important news delivered to your email inbox