What's up in
The nearest neighbor problem asks where a new point fits into an existing data set. A few researchers set out to prove that there was no universal way to solve it. Instead, they found such a way.
How many colors do you need to color an infinite plane so that no points 1 unit apart are the same color?
The latest in a new series of proofs brings theoretical computer scientists within striking distance of one of the great conjectures of their discipline.
By making the first progress on the “chromatic number of the plane” problem in over 60 years, an anti-aging pundit has achieved mathematical immortality.
Big advances in math can happen when mathematicians move ideas into areas where they seem like they shouldn’t belong.
Ramsey’s theorem predicts a surprising (and useful) consistency in the organization of graphs. Here’s a simple visual proof of how it works.
Just five days after posting a retraction, László Babai announced that he had fixed the error in his landmark graph isomorphism algorithm.
The legendary graph isomorphism problem may be harder than a 2015 result seemed to suggest.
Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field.