Abstract
Given a finite family \(\mathcal{F}\) of convex sets in ℝd, we say that \(\mathcal{F}\) has the (p,q) r property if for any p convex sets in \(\mathcal{F}\) there are at least r q-tuples that have nonempty intersection. The piercing number of \(\mathcal{F}\) is the minimum number of points we need to intersect all the sets in \(\mathcal{F}\). In this paper we will find some bounds for the piercing number of families of convex sets with (p,q) r properties.
Article PDF
Similar content being viewed by others
References
Alon, N., Kleitman, D.J.: Piercing convex sets and the Hadwiger–Debrunner (p,q)-problem. Adv. Math. 96, 103–112 (1992)
Bracho, J., Montejano, L.: Helly type theorems on the homology of the space of transversals. J. Discrete Comput. Geom. 27(3), 387–393 (2002)
Hadwiger, H., Debrunner, H.: Über eine Variante zum Hellyschen Satz. Arch. Math. 8, 309–313 (1957) (German)
Kleitman, D.J., Gyárfás, A., Tóth, G.: Convex sets in the plane with three of every four meeting. Combinatorica 21(2), 221–232 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by CONACYT, 41340.
Rights and permissions
About this article
Cite this article
Montejano, L., Soberón, P. Piercing Numbers for Balanced and Unbalanced Families. Discrete Comput Geom 45, 358–364 (2011). https://doi.org/10.1007/s00454-010-9295-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-010-9295-7