BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20260331T163000
DTEND;TZID=Asia/Seoul:20260331T173000
DTSTAMP:20260415T201705
CREATED:20250922T145919Z
LAST-MODIFIED:20260308T043639Z
UID:11631-1774974600-1774978200@dimag.ibs.re.kr
SUMMARY:Tung H. Nguyen\, Polynomial χ-boundedness for excluding the five-vertex path
DESCRIPTION:We overview the recent resolution of a 1985 open problem of Gyárfás\, that chromatic number is polynomially bounded by clique number for graphs with no induced five-vertex path. The proof introduces a chromatic density framework involving chromatic quasirandomness and chromatic density increment\, which allows us to deduce the desired statement from the Erdős–Hajnal result for the five-vertex path.
URL:https://dimag.ibs.re.kr/event/2026-03-31/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR