Related papers: Intersection patterns in spaces with a forbidden h…

Let A_1,...,A_k be a collection of families of subsets of an n-element set. We say that this collection is cross-intersecting if for any i,j in [k] with i not equal to j, A in A_i and B in A_j implies that the intersection of A and B is…

We report on some recent progress regarding combinatorial properties in convexity spaces with a bounded Radon number. In particular, we discuss the relationship between the Radon number, the colorful and fractional Helly properties, weak…

It is proved that the sum of the Loewy lengths of the homology modules of a finite free complex F over a local ring R is bounded below by a number depending only on R. This result uncovers, in the structure of modules of finite projective…

A result due to Gy\'arf\'as, Hubenko, and Solymosi (answering a question of Erd\"os) states that if a graph $G$ on $n$ vertices does not contain $K_{2,2}$ as an induced subgraph yet has at least $c\binom{n}{2}$ edges, then $G$ has a…

Let $K$ be a simplicial complex on vertex set $V$. $K$ is called $d$-Leray if the homology groups of any induced subcomplex of $K$ are trivial in dimensions $d$ and higher. $K$ is called $d$-collapsible if it can be reduced to the void…

We prove an infinite $(p,q)$-theorem for piercing fat compact convex sets in $\RR^d$ with $k$-flats. Additionally, we develop a new framework through which infinite $(p,q)$-theorems concerning compact sets and $k$-flats can be extended to…

A family of sets has the $(p, q)$ property if among any $p$ members of it some $q$ intersect. It is shown that if a finite family of compact convex sets in $\R^2$ has the $(p+1,2)$ property then it is pierced by $\lfloor \frac{p}{2} \rfloor…

We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…

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…

We provide a new quantitative version of Helly's theorem: there exists an absolute constant $\alpha >1$ with the following property: if $\{P_i: i\in I\}$ is a finite family of convex bodies in ${\mathbb R}^n$ with ${\rm int}\left…

For an $n$-element set $X$ let $\binom{X}{k}$ be the collection of all its $k$-subsets. Two families of sets $\mathcal A$ and $\mathcal B$ are called cross-intersecting if $A\cap B \neq \emptyset$ holds for all $A\in\mathcal A$,…

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

Let $\mathcal F$ be a family of compact convex sets in $\mathbb R^d$. We say that $\mathcal F $ has a \emph{topological $\rho$-transversal of index $(m,k)$} ($\rho<m$, $0<k\leq d-m$) if there are, homologically, as many transversal…

The 1913 Helly's theorem states that any family ${\cal K}$ of $n\geq d+1$ convex sets in ${\mathbb R}^d$ can be pierced by a single point if and only if any $d+1$ of ${\cal K}$'s elements can. In 2002 Alon, Kalai, Matou\v{s}ek and Meshulam…

We establish a novel connection between the well-known chromatic threshold problem in extremal combinatorics and the celebrated $(p,q)$-theorem in discrete geometry. In particular, for a graph $G$ with bounded clique number and a natural…

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 prove the following Helly-type result. Let $\mathcal{C}_1,\dots,\mathcal{C}_{3d}$ be finite families of convex bodies in $\mathbb{R}^d$. Assume that for any colorful selection of $2d$ sets, $C_{i_k}\in \mathcal{C}_{i_k}$ for each $1\leq…

Let $k\ge d\ge 3$ be fixed. Let $\mathcal{F}$ be a $k$-uniform family on $[n]$. Then $\mathcal{F}$ is $(d,s)$-conditionally intersecting if it does not contain $d$ sets with union of size at most $s$ and empty intersection. Answering a…

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…

Let $k,a,b$ be positive integers with $a+b=k$. A $k$-uniform hypergraph is called an $(a,b)$-cycle if there is a partition $(A_0,B_0,A_1,B_1,\ldots,A_{t-1},B_{t-1})$ of the vertex set with $|A_i|=a$, $|B_i|=b$ such that $A_i\cup B_i$ and…