Adjust the colors to reduce glare and give your eyes a break. Use one of the services below to sign in to PBS: You've just tried to add this video to My List. But first, we need you to sign in to PBS ...

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...

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

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

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