BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: A p-centered coloring is a vertex-coloring of a graph G such t
 hat every connected subgraph H of G either receives more than p colors or t
 here is a color that appears exactly once in H. The concept was introduced 
 by Nešetřil and Ossona de Mendez as a local condition for measuring sparsit
 y.    We prove lower bounds on the p-centered coloring numbers. For outerpl
 anar graphs\, we show that their maximum p-centered coloring number  is in 
 Theta(p log p). We have examples of graphs of treewidth k needing  (p+k cho
 ose k) colors\, this matches the upper bound of Pilipczuk and Siebertz.  We
  show that planar graphs may require Omega(p^2 log(p)) colors\, while all o
 f them admit a p-centered coloring with O(p^3 log(p)) colors. This improves
  an O(p^19) bound by Pilipczuk and Siebertz. 
DTSTAMP:20190523T142000
DTSTART:20190527T160000
CLASS:PUBLIC
LOCATION:Technische Universität Berlin\n Institut für Mathematik\n Straße d
 es 17. Juni 136\n 10623 Berlin\n Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Felix Schröder (Technische Universität Berlin): Lower Bounds on the
  p-centered coloring number
UID:95690855@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20190527-C-Sch
 roeder.html
END:VEVENT
END:VCALENDAR