BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.17.4.1//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260918T163000
DTEND;TZID=Asia/Seoul:20260918T173000
DTSTAMP:20260918T013023Z
CREATED:20260918T013023Z
LAST-MODIFIED:20260918T013023Z
UID:13364-1789749000-1789752600@dimag.ibs.re.kr
SUMMARY:David R. Wood\, The Erdős-Sós Theorem
DESCRIPTION:We present an exposition of a proof\, discovered by GPT-6 Astra\, of the Erdős-Sós Conjecture\, which states that every graph with average degree greater than t−2 contains every tree on t≥2 vertices.
URL:https://dimag.ibs.re.kr/event/2026-09-18/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR