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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250527T163000
DTEND;TZID=Asia/Seoul:20250527T173000
DTSTAMP:20260417T000411
CREATED:20250415T051555Z
LAST-MODIFIED:20250517T114823Z
UID:10778-1748363400-1748367000@dimag.ibs.re.kr
SUMMARY:Meike Hatzel\, Counterexample to Babai's lonely colour conjecture
DESCRIPTION:Motivated by colouring minimal Cayley graphs\, in 1978 Babai conjectured that no-lonely-colour graphs have bounded chromatic number. We disprove this in a strong sense by constructing graphs of arbitrarily large girth and chromatic number that have a proper edge colouring in which each cycle contains no colour exactly once. \nThe result presented is the joint work with James Davies and Liana Yepremyan.
URL:https://dimag.ibs.re.kr/event/2025-05-27/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR