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 ...
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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results