Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Dijkstra’s algorithm was long thought to be the most efficient way to find a graph’s best routes. Researchers have now proved that it’s “universally optimal.” The Quanta Newsletter ...

Now that pandemic restrictions are easing up, people are getting together again. But it’s been a while, so if you and your friends need some help breaking the ice, here’s a mathematical party game you ...