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:20230131T163000
DTEND;TZID=Asia/Seoul:20230131T173000
DTSTAMP:20260419T150719
CREATED:20230110T062223Z
LAST-MODIFIED:20240707T074122Z
UID:6639-1675182600-1675186200@dimag.ibs.re.kr
SUMMARY:Abhishek Methuku\, A proof of the Erdős–Faber–Lovász conjecture
DESCRIPTION:The Erdős–Faber–Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on n vertices is at most n. In this talk\, I will sketch a proof of this conjecture for every large n. Joint work with D. Kang\, T. Kelly\, D. Kühn and D. Osthus.
URL:https://dimag.ibs.re.kr/event/2023-01-31/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR