Related papers: A m\'elange of diameter Helly-type theorems
We present a unified approach to prove Helly-type theorems for monotone properties of boxes, such as having large volume or containing points from a given set. As a corollary, we obtain new proofs for several earlier results regarding…
Qualitatively, a no-dimensional Helly-type theorem says that if every small subfamily of convex sets has a common point in a bounded region, then suitable neighborhoods of all the sets in the whole family have a common point. Quantitative…
Given a point set $S$ in $\mathbb{R}^d$, a family of sets is $S$-intersecting if its members have a point in common in $S$. Recently, Edwards and Sober\'{o}n proved a fractional version of Halman's theorem for axis-parallel boxes, showing…
A separated $d$-interval is defined as a disjoint union of $d$ convex sets from the real line $\mathbb R$. In this paper, we establish a series of Helly-type theorems for convexity spaces derived from separated $d$-intervals. Our results…
In this short note we show that Helly's Intersection Theorem holds for convex sets in uniquely geodesic spaces (in particular in CAT(0) spaces) without the assumption that the convex sets are open or closed.
We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…
We propose a combinatorial framework to analyze quantitative Helly-type questions. Using this framework, we prove a Quantitative Fractional Helly Theorem with Fractional Helly Number 3d and a stability version of the Quantitative Helly…
We study $S$-convex sets, which are the geometric objects obtained as the intersection of the usual convex sets in $\mathbb R^d$ with a proper subset $S\subset \mathbb R^d$. We contribute new results about their $S$-Helly numbers. We extend…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
In 2008, Halman proved a discrete Helly-type theorem for axis-parallel boxes in $\mathbb R^d$. Very recently, this result was extended to the $(p,q)$ setting with $p \geq q \geq d+1$ by Edwards and Sober\'on, and subsequently to the case $p…
A convex lattice set in $\mathbb{Z}^d$ is the intersection of a convex set in $\mathbb{R}^d$ and the integer lattice $\mathbb{Z}^d$. A well-known theorem of Doignon states that the Helly number of $d$-dimensional convex lattice sets equals…
We prove that fractional Helly and $(p,q)$-theorems imply $(\aleph_0,q)$-theorems in an entirely abstract setting. We give a plethora of applications, including reproving almost all earlier $(\aleph_0,q)$-theorems about geometric…
We prove Helly-type theorems for line transversals to disjoint unit balls in $\R^{d}$. In particular, we show that a family of $n \geq 2d$ disjoint unit balls in $\R^d$ has a line transversal if, for some ordering $\prec$ of the balls, any…
We consider quantitative versions of Helly-type questions, that is, instead of finding a point in the intersection, we bound the volume of the intersection. Our first main geometric result is a quantitative version of the Fractional Helly…
Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…
The well known fractional Helly theorem and colorful Helly theorem can be merged into the so called colorful fractional Helly theorem. It states: For every $\alpha \in (0, 1]$ and every non-negative integer $d$, there is $\beta_{col} =…
The main results here are two Helly type theorems for the sum of (at most) unit vectors in a normed plane. Also, we give a new characterization of centrally symmetric convex sets in the plane.
We study parameters of the convexity spaces associated with families of sets in $\mathbb{R}^d$ where every intersection between $t$ sets of the family has its Betti numbers bounded from above by a function of $t$. Although the Radon number…
A finite family $\mathcal F$ of convex sets is $k$-intersecting in $S \subseteq \mathbb{R}^d$ if the intersection of every subset of $k$ convex sets in $\mathcal F$ contains a point in $S$. The Helly number of $S$ is the minimum $k$, if it…
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distance VC-dimension we prove several new results on the…