Blocking the k-holes of point sets in the plane

DOI10.1007/S00373-014-1488-ZzbMATH Open1321.05028OpenAlexW2007596557MaRDI QIDQ497316FDOQ497316

Authors: Javier Cano, Ferran Hurtado, J. Urrutia, Alfredo García, Toshinori Sakai, Javier Tejel 

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1488-z

Recommendations

• Lower bounds for the number of small convex \(k\)-holes
• Specified holes with pairwise disjoint interiors in planar point sets
• scientific article; zbMATH DE number 6475983
• A minimal planar point set containing a disjoint triple of a 3-hole, a 4-hole and a 5-hole
• On the minimum size of a point set containing a 5-hole and double disjoint 3-holes

zbMATH Keywords

blockingpiercing\(k\)-holes

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Polytopes and polyhedra (52B99)

Cites Work

• A modular version of the Erdős– Szekeres theorem
• On empty triangles determined by points in the plane
• Covering the convex quadrilaterals of point sets
• Planar point sets with a small number of empty convex polygons
• Title not available (Why is that?)
• On the chromatic number of some geometric type Kneser graphs
• Thickness and Antithickness of Graphs
• The chromatic number of the convex segment disjointness graph
• Konvexe Fünfecke in ebenen Punktmengen
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Title not available (Why is that?)
• Sets with No Empty Convex 7-Gons
• Empty monochromatic triangles
• A characterization of diameter-2-critical graphs whose complements are diamond-free
• Monochromatic empty triangles in two-colored point sets
• Title not available (Why is that?)

Cited In (4)

• Two disjoint 5-holes in point sets
• On almost empty monochromatic triangles and convex quadrilaterals in colored point sets
• Thirty essays on geometric graph theory
• Drawing the almost convex set in an integer grid of minimum size

This page was built for publication: Blocking the \(k\)-holes of point sets in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497316)