The Erdős-Szekeres problem

Series
Graph Theory Seminar
Time
Tuesday, October 31, 2023 - 3:30pm for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Cosmin Pohoata – Emory University – cosmin.pohoata@gmail.comhttps://pohoatza.wordpress.com/about/
Organizer
Tom Kelly

For every natural number n, if we start with sufficiently many points in R^d in general position there will always exist n points in convex position. The problem of determining quantitative bounds for this statement is known as the Erdős-Szekeres problem, and is one of the oldest problems in Ramsey theory. We will discuss some of its history, along with the recent developments in the plane and in higher dimensions.