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

Three edges e₁, e₂ and e₃ in a graph G are consecutive if they form a cycle of length 3 or a path in this order. A k-injective edge coloring of a graph G is an edge coloring of G, (not necessarily ...

The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

The color palettes extracted from fine art paintings. The study of color is undergoing a revolution. Until now, color theory has been little more than a collection of ideas based loosely on science.

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