BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.17.0//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260716T163000
DTEND;TZID=Asia/Seoul:20260716T173000
DTSTAMP:20260714T132114Z
CREATED:20260714T132005Z
LAST-MODIFIED:20260714T132114Z
UID:12891-1784219400-1784223000@dimag.ibs.re.kr
SUMMARY:Sang-il Oum (엄상일)\, A proof of the cycle double cover conjecture by OpenAI
DESCRIPTION:The cycle double cover conjecture (CDC) claims that every graph without cut-edges has a list of cycles such that every edge appears exactly twice in the list. This conjecture was proposed in 1970s by several mathematicians independently\, including Tutte\, Seymour\, and Szekeres. \nOn July 10\, 2026\, OpenAI released a proof found by its ChatGPT 5.6 Sol Ultra. I will explain a slightly modified proof\, with the aim of making it mostly accessible to undergraduate students.
URL:https://dimag.ibs.re.kr/event/2026-07-16/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR