Erdős-Szekeres-type problems in the real projective plane
From MaRDI portal
Publication:6642299
DOI10.1007/s00454-024-00691-5MaRDI QIDQ6642299
Manfred Scheucher, Martin Balko, Pavel Valtr
Publication date: 22 November 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Erd?s problems and related topics of discrete geometry (52C10) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- Two disjoint 5-holes in point sets
- Convex independent sets and 7-holes in restricted planar point sets
- Sets in \(\mathbb{R}^ d\) with no large empty convex subsets
- Konvexe Fünfecke in ebenen Punktmengen
- Crossing families
- Counting convex polygons in planar point sets
- Eine Erweiterung des Begriffes ``konvexer Körper.
- Bedingt konvergente Reihen und konvexe Systeme. (Teil I.).
- Flipping edges in triangulations
- Planar point sets determine many pairwise crossing segments
- Two extensions of the Erdős-Szekeres problem
- A superlinear lower bound on the number of 5-holes
- Carathéodory's theorem in depth
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- A combinatorial problem in geometry.
- Homotopy classification of projective convex sets
- On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3
- Convex Regions in Projective N-Space
- Computer solution to the 17-point Erdős-Szekeres problem
- Sets with No Empty Convex 7-Gons
- Empty Simplices in Euclidean Space
- The minimal size of a square which includes a digital convex 2K–gon
- On the Erdős-Szekeres convex polygon problem
- Planar point sets with a small number of empty convex polygons
- On convex holes in d-dimensional point sets
- Holes and islands in random point sets
- Tight bounds on the expected number of holes in random point sets
- A SAT attack on higher dimensional Erdős-Szekeres numbers
This page was built for publication: Erdős-Szekeres-type problems in the real projective plane
