Packing list-colourings

Abstract: List colouring is an influential and classic topic in graph theory, which is related to e.g. frequency assignment, resource allocation and scheduling problems. Sometimes it is natural to consider multiple of these and the best one can aim for is a packing of disjoint solutions/ list colourings. We investigate this natural strengthening, the list packing problem. This study was already suggested 25 years ago by Alon, Fellows and Hare. In this talk, we sketch the (conjectured) behaviour of this parameter and a related one under certain bounded degree conditions.

combinatorics

Audience: researchers in the topic

Warwick Combinatorics Seminar

Series comments: This is the online combinatorics seminar at Warwick.