Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...
Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables. Luckily, ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results