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:20260423T003249Z UID:WCS/8 DESCRIPTION:Title: Even -hole free graphs of bounded degree have bounded treewidth\nby Maria C hudnovsky (Princeton) as part of Warwick Combinatorics Seminar\n\n\nAbstra ct\nTree decompositions are a powerful tool in structural graph theory tha t is traditionally used in the context of forbidden graph minors. Connect ing tree decompositions and forbidden induced subgraphs has so far largely remained out of reach. Traditionally to bound the treewidth of a graph\, one finds a way to decompose it by a so-called laminar collection of\ndeco mpositions. Recently\, in joint work with Tara Abrishami and Kristina \nV uskovic\, we proved that even-hole free graphs of bounded degree have bou nded tree-width. To do so we used "star cutset separations" that arise nat urally in the context of even-hole-free graphs. While the set of star cuts et separations is far from being non-crossing\, it turns out that one can partition it into a bounded number of laminar collections\, and this is su fficient for our purposes.\nIn this talk we will present an outline of the proof.\n LOCATION:https://researchseminars.org/talk/WCS/8/ END:VEVENT END:VCALENDAR