Results 1  10
of
17
Transversal Numbers for Hypergraphs Arising in Geometry
 Adv. Appl. Math
, 2001
"... Introduction Helly's theorem asserts that if F is a finite family of convex sets in R d in which every d + 1 or fewer sets have a point in common then T F 6= ;. Our starting point, the (p; q) theorem, is a deep extension of Helly's theorem. It was conjectured by Hadwiger and Debrunner and prove ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Introduction Helly's theorem asserts that if F is a finite family of convex sets in R d in which every d + 1 or fewer sets have a point in common then T F 6= ;. Our starting point, the (p; q) theorem, is a deep extension of Helly's theorem. It was conjectured by Hadwiger and Debrunner and proved by Alon and Kleitman [3]. Let p q 2 be integers. A family F of convex sets in R d is said to have the (p; q) property if among every p sets of F , some q have a point in common. Theorem 1 ((p; q) theorem, Alon & Kleitmen) For every p q d+ 1 there exists a number C =
Progress in Geometric Transversal Theory
 Advances in Discrete and Computational Geometry
, 2001
"... Let A be a family of convex sets in R d . A line transversal to A is a line which intersects every member of A. More generally, a ktranversal to A is an ane subspace of dimension k which intersects every member of A. ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Let A be a family of convex sets in R d . A line transversal to A is a line which intersects every member of A. More generally, a ktranversal to A is an ane subspace of dimension k which intersects every member of A.
TRACES OF FINITE SETS: EXTREMAL PROBLEMS AND GEOMETRIC APPLICATIONS
, 1992
"... Given a hypergraph H and a subset S of its vertices, the trace of H on S is defined as HS = {E ∩ S: E ∈ H}. The Vapnik–Chervonenkis dimension (VCdimension) of H is the size of the largest subset S for which HS has 2 S edges. Hypergraphs of small VCdimension play a central role in many areas o ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Given a hypergraph H and a subset S of its vertices, the trace of H on S is defined as HS = {E ∩ S: E ∈ H}. The Vapnik–Chervonenkis dimension (VCdimension) of H is the size of the largest subset S for which HS has 2 S edges. Hypergraphs of small VCdimension play a central role in many areas of statistics, discrete and computational geometry, and learning theory. We survey some of the most important results related to this concept with special emphasis on (a) hypergraph theoretic methods and (b) geometric applications.
A Tverbergtype result on multicolored simplices
, 1998
"... Let P 1 ; P 2 ; : : : ; P d+1 be pairwise disjoint nelement point sets in general position in dspace. It is shown that there exist a point O and suitable subsets Q i P i (i = 1; 2; : : : ; d + 1) such that jQ i j c d jP i j, and every ddimensional simplex with exactly one vertex in each Q i ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Let P 1 ; P 2 ; : : : ; P d+1 be pairwise disjoint nelement point sets in general position in dspace. It is shown that there exist a point O and suitable subsets Q i P i (i = 1; 2; : : : ; d + 1) such that jQ i j c d jP i j, and every ddimensional simplex with exactly one vertex in each Q i contains O in its interior. Here c d is a positive constant depending only on d.
A Fractional Helly theorem for convex lattice sets
, 2001
"... A set of the form C " Z d , where C ` R d is convex and Z d denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of ddimensional convex lattice sets is 2 d . We prove that the fractional Helly number is only d + 1: for every d and every ff 2 (0; ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
A set of the form C " Z d , where C ` R d is convex and Z d denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of ddimensional convex lattice sets is 2 d . We prove that the fractional Helly number is only d + 1: for every d and every ff 2 (0; 1] there exists fi ? 0 such that whenever F 1 ; : : : ; Fn are convex lattice sets in Z d such that T i2I F i 6= ; for at least ff \Gamma n d+1 \Delta index sets I ` f1; 2; : : : ; ng of size d + 1 then there exists a (lattice) point common to at least fin of the F i . This implies a (p; d + 1)theorem for every p d + 1; that is, if F is a finite family of convex lattice sets in Z d such that among every p sets of F , some d + 1 intersect, then F has a transversal of size bounded by a function of d and p. 1
A Purely Combinatorial Proof of the Hadwiger Debrunner (p, q) Conjecture
"... Afamilyofsetshasthe(p, q) property if among any p members of the family some q have a nonempty intersection. The authors have proved that for every p # q # d +1 there is a c = c(p, q, d) < # such that for every family F of compact, convex sets in R which has the (p, q) property there is a set ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Afamilyofsetshasthe(p, q) property if among any p members of the family some q have a nonempty intersection. The authors have proved that for every p # q # d +1 there is a c = c(p, q, d) < # such that for every family F of compact, convex sets in R which has the (p, q) property there is a set of at most c points in R that intersects each member of F , thus settling an old problem of Hadwiger and Debrunner. Here we present a purely combinatorial proof of this result.
On a Geometric Generalization of the Upper Bound Theorem
"... We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most ℓ in an arrangement of n halfspaces in R d, for arbitrary n and d (in particular, the dimension d is not considered constant). This partially settles a conjecture of Eckhoff, Linhart, and Welzl. Up to the ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most ℓ in an arrangement of n halfspaces in R d, for arbitrary n and d (in particular, the dimension d is not considered constant). This partially settles a conjecture of Eckhoff, Linhart, and Welzl. Up to the factor of 2, the result generalizes McMullen’s Upper Bound Theorem for convex polytopes (the case ℓ = 0) and extends a theorem of Linhart for the case d ≤ 4. Moreover, the bound sharpens asymptotic estimates obtained by Clarkson and Shor. The proof is based on the hmatrix of the arrangement (a generalization, introduced by Mulmuley, of the hvector of a convex polytope). We show that bounding appropriate sums of entries of this matrix reduces to a lemma about quadrupels of sets with certain intersection properties, and we prove this lemma, up to a factor of 2, using tools from multilinear algebra. This extends an approach of Alon and Kalai, who used linear algebra methods for an alternative proof of the classical Upper Bound Theorem. The bounds for the entries of the hmatrix also imply bounds for the number of idimensional faces, i> 0, at level at most ℓ. Furthermore, we discuss a connection with crossing numbers of graphs that was one of the main motivations for investigating exact bounds that are valid for arbitrary dimensions. 1.
Berge's theorem, fractional Helly, and art galleries
"... In one of his early papers Claude Berge proved a Hellytype theorem, which replaces the usual "nonempty intersection" condition with a "convex union" condition. Inspired by this we prove a fractional Hellytype result, where we assume that many (d+1)tuples of a family of convex sets have a stars ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In one of his early papers Claude Berge proved a Hellytype theorem, which replaces the usual "nonempty intersection" condition with a "convex union" condition. Inspired by this we prove a fractional Hellytype result, where we assume that many (d+1)tuples of a family of convex sets have a starshaped union, and the conclusion is that many of the sets have a common point. We also investigate somewhat related artgallery problems.