Saturation results around the Erdős--Szekeres problem
That is, the set contains no n points in convex position while the addition of any new point creates such a configuration. This demonstrates that the saturation number is smaller than the Ramsey number for the Erdős--Szekeres problem.
Dec 2, 2023
Jun 6, 2024 · In this paper, we consider saturation problems related to the celebrated Erdős-Szekeres convex polygon problem. For each n ≥ 7, we construct a ...
Sep 11, 2024 · In this paper, we consider saturation problems related to the celebrated Erdős–Szekeres convex polygon problem. For each 𝑛 ≥ 7, we construct a ...
In this paper, we consider saturation problems related to the celebrated Erdős–Szekeres convex polygon problem. For each n ≥ 7, we construct a planar point set ...
Dec 5, 2023 · Keywords. For some reason, the recording is in two parts, this is part 1.
People also ask
What is the Erdős Szekeres theorem?
What is the Erdos discrepancy problem?
We consider analogues of this problem in other settings. We prove a saturation version of the Erdős–Szekeres theorem about monotone subsequences and saturation ...
Dec 5, 2023 · Saturation results around the Erdős–Szekeres problems, part 2 · Description of video · Keywords · Downloads · Related videos ...
Nov 5, 2010 · Im giving a small talk for a combinatorics class on the Erdos-Szekeres conjecture regarding the happy ending problem (the paper is focused on recent work ...
According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form ...
Nov 14, 2023 · This thesis will commence with an introduction to foundational concepts and provide a historical perspective on the problem's evolution.