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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240507T163000
DTEND;TZID=Asia/Seoul:20240507T173000
DTSTAMP:20260418T023825
CREATED:20240327T080653Z
LAST-MODIFIED:20240705T153041Z
UID:8434-1715099400-1715103000@dimag.ibs.re.kr
SUMMARY:Tony Huynh\, Aharoni's rainbow cycle conjecture holds up to an additive constant
DESCRIPTION:In 2017\, Aharoni proposed the following generalization of the Caccetta-Häggkvist conjecture for digraphs. If G is a simple n-vertex edge-colored graph with n color classes of size at least r\, then G contains a rainbow cycle of length at most ⌈n/r⌉. \nIn this talk\, we prove that Aharoni’s conjecture holds up to an additive constant. Specifically\, we show that for each fixed r\, there exists a constant c such that if G is a simple n-vertex edge-colored graph with n color classes of size at least r\, then G contains a rainbow cycle of length at most n/r+c. \nThis is joint work with Patrick Hompe.
URL:https://dimag.ibs.re.kr/event/2024-05-07/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR