What's up in
Researchers are turning to the mathematics of higher-order interactions to better model the complex connections within their data.
A pair of researchers has shown that trying to classify groups of numbers called “torsion-free abelian groups” is as hard as it can possibly be.
A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections.
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.
Get highlights of the most important news delivered to your email inbox