Bounded VC-dimension implies a fractional Helly theorem

被引:41
作者
Matousek, J
机构
[1] Charles Univ, Dept Math Appl, Prague 11800 1, Czech Republic
[2] Charles Univ, Inst Theoret Comp Sci, Prague 11800 1, Czech Republic
关键词
D O I
10.1007/s00454-003-2859-z
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We prove that every set system of bounded VC-dimension has a fractional Helly property. More precisely, if the dual shatter function of a set system F is bounded by o(m(k)), then F has fractional Helly number k. This means that for every alpha > 0 there exists a beta > 0 such that if F-1, F-2, . . . , F-n is an element of F are sets with boolean AND(iis an element ofI) F-i not equal 0 for at least alpha ((n)(k)) sets I subset of or equal to {1, 2, . . . , n) of size k, then there exists a point common to at least betan of the F-i. This further implies a (p, k)-theorem: for every F as above and every p greater than or equal to k there exists T such that if g C T is a finite subfamily where among every p sets, some k intersect, then 9 has a transversal of size T. The assumption about bounded dual shatter function applies, for example, to families of sets in R-d definable by abounded number of polynomial inequalities of bounded degree; in this case we obtain fractional Helly number d + 1.
引用
收藏
页码:251 / 255
页数:5
相关论文
共 12 条
[1]   BOUNDING THE PIERCING NUMBER [J].
ALON, N ;
KALAI, G .
DISCRETE & COMPUTATIONAL GEOMETRY, 1995, 13 (3-4) :245-256
[2]   PIERCING CONVEX-SETS AND THE HADWIGER-DEBRUNNER (P, Q)-PROBLEM [J].
ALON, N ;
KLEITMAN, DJ .
ADVANCES IN MATHEMATICS, 1992, 96 (01) :103-112
[3]  
Alon N., 2002, ADV APPL MATH, V130, P2509
[4]   A fractional Helly theorem for convex lattice sets [J].
Bárány, I ;
Matousek, J .
ADVANCES IN MATHEMATICS, 2003, 174 (02) :227-235
[5]   On the number of cells defined by a family of polynomials on a variety [J].
Basu, S ;
Pollack, R ;
Roy, MF .
MATHEMATIKA, 1996, 43 (85) :120-126
[6]  
Bochnak J., 1998, Ergeb. Math. Grenzgeb., V36
[7]   QUASI-OPTIMAL RANGE SEARCHING IN SPACES OF FINITE VC-DIMENSION [J].
CHAZELLE, B ;
WELZL, E .
DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) :467-489
[8]  
Eckhoff J., 1993, HDB CONVEX GEOMETRY, P389, DOI DOI 10.1016/B978-0-444-89596-7.50017-1
[9]   EPSILON-NETS AND SIMPLEX RANGE QUERIES [J].
HAUSSLER, D ;
WELZL, E .
DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) :127-151
[10]   PROBLEM OF GEOMETRY IN RN [J].
KATCHALSKI, M ;
LIU, A .
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1979, 75 (02) :284-288