BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sophie Spirkl (University of Waterloo)
DTSTART:20220113T151500Z
DTEND:20220113T170000Z
DTSTAMP:20260422T065748Z
UID:CJCS/52
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/52/">Ne
 w results on polynomial $\\chi$-boundedness</a>\nby Sophie Spirkl (Univers
 ity of Waterloo) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\n
 \nAbstract\nThe number of colours required to colour a graph $G$ (the chro
 matic number $\\chi(G)$) is at least its clique number\, that is\, the max
 imum size of a set of pairwise adjacent vertices. A class of graphs is $\\
 chi$-bounded if the converse is approximately true\, that is\, the chromat
 ic number is at most some function of the clique number. In this talk\, we
  are interested in when this function can be chosen as a polynomial. I wil
 l discuss some recent results\, mostly concerning the case of forbidding a
  single graph as an induced subgraph.\nJoint work with Maria Chudnovsky\, 
 Alex Scott and Paul Seymour.\n
LOCATION:https://researchseminars.org/talk/CJCS/52/
END:VEVENT
END:VCALENDAR