BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv5.1.6//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
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200924T100000
DTEND;TZID=Asia/Seoul:20200924T110000
DTSTAMP:20200919T234859
CREATED:20200811T231744Z
LAST-MODIFIED:20200811T231827Z
UID:2781-1600941600-1600945200@dimag.ibs.re.kr
SUMMARY:Zihan Tan\, Towards Tight(er) Bounds for the Excluded Grid Theorem
DESCRIPTION:We study the Excluded Grid Theorem\, a fundamental structural result in graph theory\, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f$\, such that for every integer $g > 0$\, every graph of treewidth at least $f(g)$ contains the g×g-grid as a minor. For every integer $g > 0$\, let $f(g)$ be the smallest value for which the theorem holds. Establishing tight bounds on $f(g)$ is an important graph-theoretic question. Robertson and Seymour showed that f(g) is at least of order $g^2 \log g$. For a long time\, the best known upper bounds on $f(g)$ were super-exponential in $g$. The first polynomial upper bound of $f(g) = O(g^{98} \operatorname{poly log} g)$ was proved by Chekuri and Chuzhoy. It was later improved to $f(g) = O(g^{36} \operatorname{poly log} g)$\, and then to $f(g) = O(g^{19} \operatorname{poly log} g)$. In this talk\, we present our recent work that further improves this bound to $f(g) = O(g^9 \operatorname{poly log} g)$ via a simpler proof. Moreover\, while there are natural barriers that seem to prevent the previous methods from yielding tight bounds for the theorem\, it seems conceivable that the techniques proposed in this talk can lead to even tighter bounds on $f(g)$. \nThis talk is based on joint work with Julia Chuzhoy.
URL:https://dimag.ibs.re.kr/event/2020-09-24/
LOCATION:Zoom
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR