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:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210127T100000
DTEND;TZID=Asia/Seoul:20210127T110000
DTSTAMP:20260424T013059
CREATED:20210114T124234Z
LAST-MODIFIED:20240705T191135Z
UID:3500-1611741600-1611745200@dimag.ibs.re.kr
SUMMARY:Dong Yeap Kang (강동엽)\, A proof of the Erdős-Faber-Lovász conjecture
DESCRIPTION:A hypergraph is linear if every pair of two distinct edges shares at most one vertex. A longstanding conjecture by Erdős\, Faber\, and Lovász in 1972\, states that the chromatic index of any linear hypergraph on $n$ vertices is at most $n$. \nIn this talk\, I will present the ideas to prove the conjecture for all large $n$. This is joint work with Tom Kelly\, Daniela Kühn\, Abhishek Methuku\, and Deryk Osthus.
URL:https://dimag.ibs.re.kr/event/2021-01-27/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR