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:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220711T163000
DTEND;TZID=Asia/Seoul:20220711T173000
DTSTAMP:20260420T070530
CREATED:20220711T073000Z
LAST-MODIFIED:20240707T075632Z
UID:5896-1657557000-1657560600@dimag.ibs.re.kr
SUMMARY:Kevin Hendrey\, Product Structure of Graph Classes with Bounded Treewidth
DESCRIPTION:The strong product $G\boxtimes H$ of graphs $G$ and $H$ is the graph on the cartesian product $V(G)\times V(H)$ such that vertices $(v\,w)$ and $(x\,y)$ are adjacent if and only if $\max\{d_G(v\,x)\,d_H(w\,y)\}=1$. Graph product structure theory aims to describe complicated graphs in terms of subgraphs of strong products of simpler graphs. This area of research was initiated by Dujmović\, Joret\, Micek\, Morin\, Ueckerdt and Wood\, who showed that every planar graph is a subgraph of the strong product of a $H\boxtimes P\boxtimes K_3$ for some path $P$ and some graph $H$ of treewidth at most $3$. In this talk\, I will discuss the product structure of various graph classes of bounded treewidth. As an example\, we show that there is a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that every planar graph of treewidth at most $k$ is a subgraph of $H\boxtimes K_{f(k)}$ for some graph $H$ of treewidth at most $3$. \nThis is based on joint work with Campbell\, Clinch\, Distel\, Gollin\, Hickingbotham\, Huynh\, Illingworth\, Tamitegama\, Tan and Wood.
URL:https://dimag.ibs.re.kr/event/2022-07-11/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR