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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20201208T163000
DTEND;TZID=Asia/Seoul:20201208T173000
DTSTAMP:20260419T170520
CREATED:20201120T042705Z
LAST-MODIFIED:20240705T193010Z
UID:3287-1607445000-1607448600@dimag.ibs.re.kr
SUMMARY:Hong Liu (刘鸿)\, A solution to Erdős and Hajnal's odd cycle problem
DESCRIPTION:I will go over the history on the study of the set of cycle lengths of graphs with large average degree or chromatic number\, and discuss recent work with Richard Montgomery on this topic. In particular\, we will see the divergence of harmonic sum of odd cycle lengths in graphs with large chromatic number and the appearance of cycle lengths in very sparse sequences (such as powers of 2). The methods developed in this work allows also us to embed equally divided clique subdivisions\, which was conjectured by Thomassen.
URL:https://dimag.ibs.re.kr/event/2020-12-08/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR