Resumen: Let P be a set of n points in the plane in general position. A subset H of P consisting of k elements that are the vertices of a convex polygon is called a k-hole of P, if there is no element of P in the interior of its convex hull. A set B of points in the plane blocks the k-holes of P if any k-hole of P contains at least one element of B in the interior of its convex hull. In this paper we establish upper and lower bounds on the sizes of k-hole blocking sets, with emphasis in the case k=5. Idioma: Inglés DOI: 10.1007/s00373-014-1488-z Año: 2015 Publicado en: GRAPHS AND COMBINATORICS 31, 5 (2015), 1271-1287 ISSN: 0911-0119 Factor impacto JCR: 0.48 (2015) Categ. JCR: MATHEMATICS rank: 212 / 312 = 0.679 (2015) - Q3 - T3 Factor impacto SCIMAGO: 0.805 - Theoretical Computer Science (Q2) - Discrete Mathematics and Combinatorics (Q2)