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 ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

Researchers thought that they were five years away from solving a math riddle from the 1980's. In reality, and without knowing, they had nearly cracked the problem and had just given away much of the ...