A Mélange of Diameter Helly-Type Theorems

  title={A M{\'e}lange of Diameter Helly-Type Theorems},
  author={Travis Dillon and Pablo Sober'on},
  journal={SIAM J. Discret. Math.},
A Helly-type theorem for diameter provides a bound on the diameter of the intersection of a finite family of convex sets in $\mathbb{R}^d$ given some information on the diameter of the intersection of all sufficiently small subfamilies. We prove fractional and colorful versions of a longstanding conjecture by Barany, Katchalski, and Pach. We also show that a Minkowski norm admits an exact Helly-type theorem for diameter if and only if its unit ball is a polytope and prove a colorful version for… 
3 Citations

Figures from this paper

A Quantitative Helly-Type Theorem: Containment in a Homothet

We introduce a new variant of quantitative Helly-type theorems: the minimal “homothetic distance” of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As

Quantitative Helly-type theorems via sparse approximation

. We prove the following sparse approximation result for polytopes. Assume that Q ⊂ R d is a polytope in John’s position. Then there exist at most 2 d vertices of Q whose convex hull Q (cid:48)

Helly-type problems

This paper presents a variety of problems in the interface between combinatorics and geometry around the theorems of Helly, Radon, Caratheodory, and Tverberg, and explains some of its main themes and goals.



Helly‐type theorems for the diameter

We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in Rd has a large diameter. This includes colourful, fractional and (p,q) versions of Helly's

Polynomial estimates towards a sharp Helly-type theorem for the diameter of convex sets

We discuss a problem posed by Bárány, Katchalski and Pach: if {Pi : i ∈ I} is a family of closed convex sets in R such that diam (⋂ i∈I Pi ) = 1 then there exist s 6 2n and i1, . . . , is ∈ I such

Discrete quantitative Helly-type theorems with boxes

Helly numbers of algebraic subsets of ℝd and an extension of Doignon’s Theorem

Abstract We study S-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in ℝd with a proper subset S ⊂ ℝd, and contribute new results about their

Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets

A new variation of Tverberg’s theorem is presented, given a discrete set S, and the number of points needed to guarantee the existence of an m-partition of the points such that the intersection of the m convex hulls of the parts contains at least k points of S.

A quantitative Doignon-Bell-Scarf theorem

It is proved that there exists a constant c(n,k), depending only on the dimension n and k, such that if a polyhedron {x∈Rn: Ax≤b} contains exactly k integer points, thenthere exists a subset of the rows, of cardinality no more than c( n,k,), defining apolyhedron that contains exactly the same kinteger points.


INTRODUCTION Let F be a family of convex sets in R. A geometric transversal is an affine subspace that intersects every member of F . More specifically, for a given integer 0 ≤ k < d, a k-dimensional

Characterization off-vectors of families of convex sets inRd Part I: Necessity of Eckhoff’s conditions

LetK=K1,...,Kn be a family ofn convex sets inRd. For 0≦i<n denote byfi the number of subfamilies ofK of sizei+1 with non-empty intersection. The vectorf(K) is called thef-vectors ofK. In 1973 Eckhoff

Proof of a Conjecture of Bárány, Katchalski and Pach

Bárány, Katchalski and Pach (Proc Am Math Soc 86(1):109–114, 1982) (see also Bárány et al., Am Math Mon 91(6):362–365, 1984) proved the following quantitative form of Helly’s theorem. If the

Quantitative (p, q) theorems in combinatorial geometry