A note on the value in the disjoint convex partition problem
From MaRDI portal
Publication:1991778
DOI10.1134/S0001434618070143zbMath1409.52003OpenAlexW2895100662MaRDI QIDQ1991778
Publication date: 30 October 2018
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434618070143
Erd?s problems and related topics of discrete geometry (52C10) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum size of a point set containing a 5-hole and double disjoint 3-holes
- Konvexe Fünfecke in ebenen Punktmengen
- On a partition into convex polygons
- Disjoint empty convex pentagons in planar point sets
- A note on the upper bound for disjoint convex partitions
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Computer solution to the 17-point Erdős-Szekeres problem
- Reconfirmation of Two Results on Disjoint Empty Convex Polygons
- Sets with No Empty Convex 7-Gons
- 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
- On the number of disjoint convex quadrilaterals for a planar point set
This page was built for publication: A note on the value in the disjoint convex partition problem