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:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20210210T163000
DTEND;TZID=Asia/Seoul:20210210T173000
DTSTAMP:20260419T164403
CREATED:20201231T073729Z
LAST-MODIFIED:20240705T191150Z
UID:3428-1612974600-1612978200@dimag.ibs.re.kr
SUMMARY:Jie Ma (马杰)\, Non-repeated cycle lengths and Sidon sequences
DESCRIPTION:We prove a conjecture of Boros\, Caro\, Furedi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths\, which is a restricted version of a longstanding problem of Erdos. Our proof together with the matched lower bound construction of Boros\, Caro\, Furedi and Yuster show that this problem can be conceptually reduced to the seminal problem of finding the maximum Sidon sequences in number theory. Joint work with Tianchi Yang.
URL:https://dimag.ibs.re.kr/event/2021-02-10/
LOCATION:Zoom ID: 869 4632 6610 (ibsdimag)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR