On the Erd\H{o}s-Tuza-Valtr Conjecture
Jineon Baek

TL;DR
This paper proves a new case of the Erd ext{"o}s-Tuza-Valtr conjecture, establishing conditions under which a point set contains either a convex n-gon or points on a concave downward curve, advancing understanding of geometric configurations.
Contribution
It provides the first new case proof of the Erd ext{"o}s-Tuza-Valtr conjecture since 1935, linking point set properties to convex and concave configurations.
Findings
Sets of inom{n-1}{2} + 2 points with no three collinear contain either a convex n-gon or four points on a concave downward curve.
The result extends the understanding of geometric configurations related to the Erd ext{"o}s-Szekeres conjecture.
The proof confirms the conjecture's validity for a specific new case, bridging a gap since the original 1935 work.
Abstract
The Erd\H{o}s-Szekeres conjecture states that any set of more than points in the plane with no three on a line contains the vertices of a convex -gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any set of more than points in a plane either contains the vertices of a convex -gon, points lying on a concave downward curve, or points lying on a concave upward curve. They also showed that the generalization is actually equivalent to the Erd\H{o}s-Szekeres conjecture. We prove the first new case of the Erd\H{o}s-Tuza-Valtr conjecture since the original 1935 paper of Erd\H{o}s and Szekeres. Namely, we show that any set of points in the plane with no three points on a line and no two points sharing the same -coordinate either contains 4 points lying on a concave downward…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Computational Geometry and Mesh Generation · Limits and Structures in Graph Theory
