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:20250902T163000
DTEND;TZID=Asia/Seoul:20250902T173000
DTSTAMP:20260416T144230
CREATED:20250804T030207Z
LAST-MODIFIED:20250804T040402Z
UID:11325-1756830600-1756834200@dimag.ibs.re.kr
SUMMARY:Zhifei Yan\, A Rainbow version of Lehel's conjecture
DESCRIPTION:Lehel’s conjecture states that every 2-edge-colouring of the complete graph $K_n$ admits a partition of its vertices into two monochromatic cycles. This was proven for sufficiently large n by Luczak\, Rödl\, and Szemerédi (1998)\, extended by Allen (2008)\, and fully resolved by Bessy and Thomassé in 2010. \nWe consider a rainbow version of Lehel’s conjecture for properly edge-coloured complete graphs. We prove that for any properly edge-coloured $K_n$ with sufficiently large n\, there exists a partition of the vertex set into two rainbow cycles\, each containing no two edges of the same colour. \nThis is joint work with Pedro Araújo\, Xiaochuan Liu\, Taísa Martins\, Walner Mendonça\, Luiz Moreira\, and Vinicius Fernandes dos Santos.
URL:https://dimag.ibs.re.kr/event/2025-09-02/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR