|Discrete Mathematics and Optimization Seminar
UniversitÚ Lyon I & CNRS
Monday September 29th at 4.30pm
Title. Colourings and Cycle Covers in Digraphs.
Abstract. In 1964, T. Gallai conjectured that the vertex set of any strong digraph D
can be covered by alpha(D) directed circuits,
where alpha(D) denotes the stability number of D. We outline a recent proof of this
conjecture by S. Bessy and S. ThomassÚ,
and discuss some related open questions.