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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20231024T163000
DTEND;TZID=Asia/Seoul:20231024T173000
DTSTAMP:20260418T225036
CREATED:20231005T065005Z
LAST-MODIFIED:20240705T161015Z
UID:7714-1698165000-1698168600@dimag.ibs.re.kr
SUMMARY:Robert Hickingbotham\, Powers of planar graphs\, product structure\, and blocking partitions
DESCRIPTION:Graph product structure theory describes complex graphs in terms of products of simpler graphs. In this talk\, I will introduce this subject and talk about some of my recent results in this area. The focus of my talk will be on a new tool in graph product structure theory called `blocking partitions.’ I’ll show how this tool can be used to prove stronger product structure theorems for powers of planar graphs as well as $k$-planar graphs\, resolving open problems of Dujmović\, Morin and Wood\, and Ossona de Mendez.
URL:https://dimag.ibs.re.kr/event/2023-10-24/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR