BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Stijn Cambie (Warwick)
DTSTART:20220223T140000Z
DTEND:20220223T150000Z
DTSTAMP:20260423T003301Z
UID:WCS/49
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/49/">Pac
 king list-colourings</a>\nby Stijn Cambie (Warwick) as part of Warwick Com
 binatorics Seminar\n\n\nAbstract\nList colouring is an influential and cla
 ssic 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 d
 isjoint solutions/ list colourings. We investigate this natural strengthen
 ing\, the list packing problem.\nThis 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 degr
 ee conditions.\n
LOCATION:https://researchseminars.org/talk/WCS/49/
END:VEVENT
END:VCALENDAR