BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250225T163000
DTEND;TZID=Asia/Seoul:20250225T173000
DTSTAMP:20260417T070509
CREATED:20250104T011404Z
LAST-MODIFIED:20250214T002236Z
UID:10354-1740501000-1740504600@dimag.ibs.re.kr
SUMMARY:Sepehr Hajebi\, The pathwidth theorem for induced subgraphs
DESCRIPTION:We present a full characterization of the unavoidable induced subgraphs of graphs with large pathwidth. This consists of two results. The first result says that for every forest H\, every graph of sufficiently large pathwidth contains either a large complete subgraph\, a large complete bipartite induced minor\, or an induced minor isomorphic to H. The second result describes the unavoidable induced subgraphs of graphs with a large complete bipartite induced minor. \nWe will also try to discuss the proof of the first result with as much detail as time permits. \nBased on joint work with Maria Chudnovsky and Sophie Spirkl.
URL:https://dimag.ibs.re.kr/event/2025-02-25/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR