BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The dichromatic number of a digraph is the smallest number of
acyclic subsets of vertices (not spanning a directed cycle) that can be use
d to cover its vertex-set. This parameter is a natural extension of the chr
omatic number to directed graphs and has been introduced in 1980 by ErdÃ¶s a
nd Neumann-Lara. Since 2000\, many groups of authors have studied this para
meter intensively and in various settings. In this talk\, I will give a sma
ll survey of this topic\, which has concerned me quite a bit in the last 3-
epsilon years. I will also mention own results obtained during my PhD at ap
propriate places.
DTSTAMP:20210623T184800
DTSTART:20210712T160000
CLASS:PUBLIC
LOCATION:online
SEQUENCE:0
SUMMARY:Raphael Steiner (Technische UniversitÃ¤t Berlin): The dichromatic nu
mber-a survey
UID:107919187@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20210712-C-Steiner.html
END:VEVENT
END:VCALENDAR