Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, ...

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. “There is no absolute randomness in ...

Graph learning and topology inference techniques aim to reconstruct network structures from observational data by treating measurements as signals defined on unknown graphs. These approaches draw on ...