Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in the ...

The Erdős–Pósa property forms a pivotal concept in modern graph theory by establishing a profound duality between the problems of packing and covering cycles or other substructures. At its core, this ...

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks — vertices (dots) and edges (lines connecting them) — has been an invaluable way ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...