BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: In 1935\, Erdős and Szekeres proved that\, for every positive
integer k\, every sufficiently large point set contains a "k-gon"\, that is
\, a subset of k points which is the vertex set of a convex polygon. Their
theorem is a classical result in both\, combinatorial geometry and Ramsey t
heory\, and motivated a lot of further research including numerous modifica
tions and extensions of the theorem. In this talk we discuss some results a
nd methods that played an essential role in the study of k-gons and the var
iant of "k-holes".
DTSTAMP:20211104T165600
DTSTART:20211108T141500
CLASS:PUBLIC
LOCATION:Technische Universität Berlin\n Institut für Mathematik\n Straße d
es 17. Juni 136\n 10623 Berlin\n Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Manfred Scheucher (Technische Universität Berlin): Erdős-Szekeres-t
ype Problems on Planar Point Sets
UID:107919410@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20211108-L-Scheucher.html
END:VEVENT
END:VCALENDAR