BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Maria Chudnovsky (Princeton)
DTSTART:20201030T140000Z
DTEND:20201030T150000Z
DTSTAMP:20260404T145134Z
UID:WCS/8
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/WCS/8
 /">Even-hole free graphs of bounded degree have bounded treewidth</a>\nby 
 Maria Chudnovsky (Princeton) as part of Warwick Combinatorics Seminar\n\n\
 nAbstract\nTree decompositions are a powerful tool in structural graph the
 ory that is  traditionally used in the context of forbidden graph minors. 
 Connecting tree decompositions and forbidden induced subgraphs has so far 
 largely remained out of reach. Traditionally to bound the treewidth of a g
 raph\, one finds a way to decompose it by a so-called laminar collection o
 f\ndecompositions.  Recently\, in joint work with Tara Abrishami and Krist
 ina \nVuskovic\,  we proved that even-hole free graphs of bounded degree h
 ave bounded tree-width. To do so we used "star cutset separations" that ar
 ise naturally in the context of even-hole-free graphs. While the set of st
 ar cutset separations is far from being non-crossing\, it turns out that o
 ne can partition it into a bounded number of laminar collections\, and thi
 s is sufficient for our purposes.\nIn this talk we will present an outline
  of the proof.\n
LOCATION:https://stable.researchseminars.org/talk/WCS/8/
END:VEVENT
END:VCALENDAR