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;VALUE=DATE:20231015
DTEND;VALUE=DATE:20231021
DTSTAMP:20260418T225038
CREATED:20230911T044555Z
LAST-MODIFIED:20240705T161223Z
UID:7616-1697328000-1697846399@dimag.ibs.re.kr
SUMMARY:2023 Vertex-Minor Workshop
DESCRIPTION:This workshop aims to foster collaborative discussions and explore the various aspects of vertex-minors\, including structural theory and their applications. \nThis event will be small-scale\, allowing for focused talks and meaningful interactions among participants. \nWebsite: https://indico.ibs.re.kr/event/596/
URL:https://dimag.ibs.re.kr/event/2023-vertex-minor-workshop/
LOCATION:SONO BELLE Jeju
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20231017T163000
DTEND;TZID=Asia/Seoul:20231017T173000
DTSTAMP:20260418T225038
CREATED:20230918T023401Z
LAST-MODIFIED:20240707T072941Z
UID:7670-1697560200-1697563800@dimag.ibs.re.kr
SUMMARY:Matija Bucić\, Essentially tight bounds for rainbow cycles in proper edge-colourings
DESCRIPTION:An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting problems in a variety of areas. A particularly intensively studied question due to Keevash\, Mubayi\, Sudakov and Verstraëte from 2007 asks for the maximum possible average degree of a properly edge-coloured graph on n vertices without a rainbow cycle. Improving upon a series of earlier bounds\, Tomon proved an upper bound of $(\log n)^{2+o(1)}$ for this question. Very recently\, Janzer-Sudakov and Kim-Lee-Liu-Tran independently removed the $o(1)$ term in Tomon’s bound. We show that the answer to the question is equal to $(\log n)^{1+o(1)}$.\nA key tool we use is the theory of robust sublinear expanders. In addition\, we observe a connection between this problem and several questions in additive number theory\, allowing us to extend existing results on these questions for abelian groups to the case of non-abelian groups.\nJoint work with: Noga Alon\, Lisa Sauermann\, Dmitrii Zakharov and Or Zamir.
URL:https://dimag.ibs.re.kr/event/2023-10-17/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR