On the minimum size of a point set containing a 5-hole and double disjoint 3-holes

DOI10.1134/S0001434615050314zbMath1331.52025MaRDI QIDQ745644

Xinshang You, Xianglin Wei

Publication date: 14 October 2015

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

general positionfinite planar point set\(k\)-holepairwise disjoint holes problems

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Configuration theorems in linear incidence geometry (51A20)

Related Items (2)

Two disjoint 5-holes in point sets ⋮ A note on the value in the disjoint convex partition problem

Cites Work

• Unnamed Item
• Unnamed Item
• Konvexe Fünfecke in ebenen Punktmengen
• On a partition into convex polygons
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• 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: On the minimum size of a point set containing a 5-hole and double disjoint 3-holes