BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.16.3//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260609T163000
DTEND;TZID=Asia/Seoul:20260609T173000
DTSTAMP:20260609T013152
CREATED:20260420T212857Z
LAST-MODIFIED:20260522T151349Z
UID:12560-1781022600-1781026200@dimag.ibs.re.kr
SUMMARY:J. Pascal Gollin\, Dominated balanced separators in wheel-induced-minor-free graphs
DESCRIPTION:The grid theorem of Robertson and Seymour can be equivalently stated using balanced separators\, that are separators whose deletion leaves every component with no more than half of the vertices of the graph\, as follows. Every graph that excludes some planar graph as a minor has a balanced separator of bounded size. Building on this formulation\, Gartland and Lokshtanov conjectured an induced minor version of that theorem inspired by coarse graph theory. They conjectured that every graph that excludes some planar graph as an induced minor has a balanced separator which is dominated by a bounded number of vertices. We confirm this conjecture for excluding any fixed wheel\, that is\, a cycle together with a universal vertex\, as an induced minor. \nThis talk is based on joint work with Maria Chudnovsky\, Matjaž Krnc\, and Martin Milanič.
URL:https://dimag.ibs.re.kr/event/2026-06-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR