Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...

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

In 1950 Edward Nelson, then a student at the University of Chicago, asked the kind of deceptively simple question that can give mathematicians fits for decades. Imagine, he said, a graph — a ...

The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices are ...