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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20240102T163000
DTEND;TZID=Asia/Seoul:20240102T173000
DTSTAMP:20260418T160114
CREATED:20230828T061831Z
LAST-MODIFIED:20240705T161245Z
UID:7552-1704213000-1704216600@dimag.ibs.re.kr
SUMMARY:Daniel McGinnis\, Applications of the KKM theorem to problems in discrete geometry
DESCRIPTION:We present the KKM theorem and a recent proof method utilizing it that has proven to be very useful for problems in discrete geometry. For example\, the method was used to show that for a planar family of convex sets with the property that every three sets are pierced by a line\, there are three lines whose union intersects each set in the family. This was previously a long-unsolved problem posed by Eckhoff. We go over a couple of examples demonstrating the method and propose a potential future research direction to push the method even further.
URL:https://dimag.ibs.re.kr/event/2024-01-02/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR