Randomly colouring graphs (a combinatorial view)

Jean-Sébastien Sereni (1, 2)

1 KAM - Department of Applied Mathematics (KAM)
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

The application of the probabilistic method to graph colouring has been yielding interesting results for more than 40 years. Several probabilistic tools are presented in this survey, ranging from the basic to the more advanced. For each of them, an application to a graph colouring problem is presented in detail. In this way, not only is the general idea of the method exposed, but also are the concrete details arising with its application. Further, this allows us to introduce some important variants of the usual graph colouring notion (with some related open questions), and at the same time to illustrate the variety of the probabilistic techniques. The survey tries to be self-contained.

Domaines: Mathématique discrète [cs.DM]

Jean-Sébastien Sereni. Randomly colouring graphs (a combinatorial view). Computer Science Review, 2008, 2 (2), pp.63--95. ⟨10.1016/j.cosrev.2008.05.003⟩. ⟨hal-00487312⟩