A positive fraction Erdős-Szekeres theorem and its applications

DOI10.1007/s00454-023-00510-3zbMath1530.05020arXiv2112.01750OpenAlexW4200634610WikidataQ122715466 ScholiaQ122715466MaRDI QIDQ6186490

Ji Zeng, Andrew Suk

Publication date: 9 January 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.01750

zbMATH Keywords

Erdős-Szekeres theoremmutually avoiding setsBiarc diagramsblock-monotone sequences

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Graph representations (geometric and intersection representations, etc.) (05C62) Extremal combinatorics (05D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curve-constrained drawings of planar graphs
• Ordered Ramsey theory and track representations of graphs
• Partitioning a sequence into few monotone subsequences
• The book thickness of a graph
• On computing the length of longest increasing subsequences
• Crossing families
• A positive fraction Erdős-Szekeres theorem
• The partitioned version of the Erdős-Szekeres theorem
• Planar point sets determine many pairwise crossing segments
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• A positive fraction mutually avoiding sets theorem
• Erdős-Szekeres-type theorems for monotone paths and convex bodies

This page was built for publication: A positive fraction Erdős-Szekeres theorem and its applications