On Erd\"os--Szekeres problem and related problems
Vitaliy Koshelev
TL;DR
This paper surveys recent results related to the Erdős–Szekeres problem, highlighting new findings and providing references for detailed proofs within the context of combinatorial geometry.
Contribution
It presents a concise survey of new results on the Erdős–Szekeres problem, including references to complete proofs and related literature.
Findings
Summary of recent advances in Erdős–Szekeres problem
References to complete proofs and related literature
Highlights of new results in combinatorial geometry
Abstract
Here we give a short survey of our new results. References to the complete proofs can be found in the text of this article and in the litterature.
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
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Finite Group Theory Research