Blocking the k-holes of point sets in the plane

DOI10.1007/S00373-014-1488-ZMaRDI QIDQ497316zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

blockingpiercing\(k\)-holes

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(4)

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

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)