A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

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

This course is available on the BSc in Data Science, BSc in Mathematics and Economics, BSc in Mathematics with Data Science, BSc in Mathematics with Economics, BSc in Mathematics, Statistics and ...

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

How do you schedule, in as few days as possible, thousands of students for hundreds of exams without anyone being scheduled for two exams at the same time? This is a hard problem to solve. Yet the ...

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