BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241029T163000
DTEND;TZID=Asia/Seoul:20241029T173000
DTSTAMP:20260415T200834
CREATED:20240919T043705Z
LAST-MODIFIED:20240919T043705Z
UID:9894-1730219400-1730223000@dimag.ibs.re.kr
SUMMARY:Felix Christian Clemen\, Triangles in the Plane
DESCRIPTION:A classical problem in combinatorial geometry\, posed by Erdős in 1946\, asks to determine the maximum number of unit segments in a set of $n$ points in the plane. Since then a great variety of extremal problems in finite planar point sets have been studied. Here\, we look at such questions concerning triangles. Among others we answer the following question asked by Erdős and Purdy almost 50 years ago: Given $n$ points in the plane\, how many triangles can be approximate congruent to equilateral triangles? \nFor our proofs we use hypergraph Turán theory. This is joint work with Balogh and Dumitrescu.
URL:https://dimag.ibs.re.kr/event/2024-10-29/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR