Two disjoint 5-holes in point sets
From MaRDI portal
Publication:827302
DOI10.1016/j.comgeo.2020.101670zbMath1474.68428arXiv1807.10848OpenAlexW3033840027MaRDI QIDQ827302
Publication date: 7 January 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.10848
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Erd?s problems and related topics of discrete geometry (52C10) Computer assisted proofs of proofs-by-exhaustion type (68V05)
Related Items
On crossing-families in planar point sets ⋮ Unnamed Item ⋮ Faradžev Read-type enumeration of non-isomorphic CC systems ⋮ Topological Drawings Meet Classical Theorems from Convex Geometry ⋮ Connectivity of triangulation flip graphs in the plane
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Blocking the \(k\)-holes of point sets in the plane
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- Abstract order type extension and new results on the rectilinear crossing number
- Konvexe Fünfecke in ebenen Punktmengen
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Enumerating order types for small point sets with applications
- Finding sets of points without empty convex 6-gons
- Connectivity of triangulation flip graphs in the plane
- Disjoint empty convex pentagons in planar point sets
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Covering the convex quadrilaterals of point sets
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Multidimensional Sorting
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Computer solution to the 17-point Erdős-Szekeres problem
- Sets with No Empty Convex 7-Gons
- A superlinear lower bound on the number of 5-holes
- On the Erdős-Szekeres convex polygon problem
- A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
- On the minimum size of a point set containing a 5-hole and a disjoint 4-hole
- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons
- A SAT attack on the Erdős-Szekeres conjecture
- Sweeps, arrangements and signotopes
- On the number of disjoint convex quadrilaterals for a planar point set
This page was built for publication: Two disjoint 5-holes in point sets
