Edge colouring is a fundamental concept in graph theory whereby colours are assigned to the edges of a graph such that no two adjacent edges share the same colour. This process is central to numerous ...

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...

Fifty years ago, Paul Erdős and two other mathematicians came up with a graph theory problem that they thought they might solve on the spot. A team of mathematicians has finally settled it. In the ...

In the fall of 1972, Vance Faber was a new professor at the University of Colorado. When two influential mathematicians, Paul Erdős and László Lovász, came for a visit, Faber decided to host a tea ...