Piercing Numbers for Balanced and Unbalanced Families

被引:6
作者
Montejano, Luis [1 ]
Soberon, Pablo [1 ]
机构
[1] Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
关键词
CONVEX-SETS;
D O I
10.1007/s00454-010-9295-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Given a finite family F of convex sets in R(d), we say that F has the (p,q)(r) property if for any p convex sets in F there are at least r q-tuples that have nonempty intersection. The piercing number of F is the minimum number of points we need to intersect all the sets in F. In this paper we will find some bounds for the piercing number of families of convex sets with (p,q)(r) properties.
引用
收藏
页码:358 / 364
页数:7
相关论文
共 4 条