Related papers: A note on the colorful fractional Helly theorem

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at…

A quick proof of Gallai's celebrated theorem on color-critical graphs is given from Gallai's simple, ingenious lemma on factor-critical graphs, in terms of partitioning the vertex-set into a minimum number of hyperedges of a hereditary…

We prove a colorful extension of a Helly-type theorem by Danzer and Gr\"{u}nbaum (Combinatorica, 1982) concerning two-piercing families of axis-parallel boxes in $\mathbb{R}^d$. We also show that our result is tight by constructing extremal…

Assume that $k \le d$ is a positive integer and $\C$ is a finite collection of convex bodies in $\R^d$. We prove a Helly type theorem: If for every subfamily $\C^*\subset \C$ of size at most $\max \{d+1,2(d-k+1)\}$ the set $\bigcap \C^*$…

We describe a connection between the combinatorics of generators for certain groups and the combinatorics of Helly's 1913 theorem on convex sets. We use this connection to prove fixed point theorems for actions of these groups on…

The Helly number of a family of sets with empty intersection is the size of its largest inclusion-wise minimal sub-family with empty intersection. Let F be a finite family of open subsets of an arbitrary locally arc-wise connected…

Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…

The main purpose of this paper is to study extremal results on the intersection graphs of boxes in $\R^d$. We calculate exactly the maximal number of intersecting pairs in a family $\F$ of $n$ boxes in $\R^d$ with the property that no $k+1$…

Recently geometric hypergraphs that can be defined by intersections of pseudohalfplanes with a finite point set were defined in a purely combinatorial way. This led to extensions of earlier results about points and halfplanes to…

Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty intersection. This is a classical and widely studied class of graphs. In this article we focus on groups acting geometrically on Helly graphs --…

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…

Let $K$ be the scalar field of real numbers or complex numbers and $L^{0}(\mathcal{F},K)$ the algebra of equivalence classes of $K-$valued random variables defined on a probability space $(\Omega,\mathcal{F},P)$. In this paper, we first…

Krasnosselsky's art gallery theorem gives a combinatorial characterization of star-shaped sets in Euclidean spaces, similar to Helly's characterization of finite families of convex sets with non-empty intersection. We study colorful and…

A collection of sets is intersecting, if any pair of sets in the collection has nonempty intersection. A collection of sets \(\mathcal{C}\) has the Helly property if any intersecting subcollection has nonempty intersection. A graph is…

We prove discrete Helly-type theorems for pseudohalfplanes, which extend recent results of Jensen, Joshi and Ray about halfplanes. Among others we show that given a family of pseudohalfplanes $\cal H$ and a set of points $P$, if every…

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…

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of B\'ar\'any, the existence of weak…

We prove a new fractional Helly theorem for families of sets obeying topological conditions. More precisely, we show that the nerve of a finite family of open sets (and of subcomplexes of cell complexes) in R^d is k-Leray where k depends on…

We introduce and study a new class of $\eps$-convex bodies (extending the class of convex bodies) in metric and normed linear spaces. We analyze relations between characteristic properties of convex bodies, demonstrate how $\eps$-convex…