English
Related papers

Related papers: A note on infinite versions of $(p,q)$-theorems

200 papers

We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional…

Metric Geometry · Mathematics 2015-09-29 Pablo Soberón

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…

Combinatorics · Mathematics 2025-07-01 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi

An infinite $(p,q)$-theorem, or an $(\aleph_0,q)$-theorem, involving two families $\mathcal{F}$ and $\mathcal{G}$ of sets, states that if in every infinite subset of $\mathcal{F}$, there are $q$ sets that are intersected by some set in…

Combinatorics · Mathematics 2025-09-12 Sutanoya Chakraborty , Arijit Ghosh

We provide a geometric proof of the $(\aleph_{0}, d+1)$-theorem for piercing compact connected sets by hyperplanes. Our argument uses only elementary properties of convex sets and clarifies the core geometric structure behind the theorem.

Combinatorics · Mathematics 2025-09-10 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi

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…

Combinatorics · Mathematics 2007-05-23 Stephan Hell

In this paper we study generalizations of classical results on intersection patterns of set systems in $\mathbb{R}^d$, such as the fractional Helly theorem or the $(p,q)$-theorem, in the setting of arbitrary triangulable spaces with a…

Computational Geometry · Computer Science 2026-05-19 Xavier Goaoc , Andreas F. Holmsen , Zuzana Patáková

Two celebrated extensions of Helly's theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of B\'ar\'any, Katchalski, and Pach (1982). Improving on several recent works, we prove an…

Combinatorics · Mathematics 2024-05-22 Nóra Frankl , Attila Jung , István Tomon

Helly's theorem is a classical result concerning the intersection patterns of convex sets in $\mathbb{R}^d$. Two important generalizations are the colorful version and the fractional version. Recently, B\'{a}r\'{a}ny et al. combined the…

Combinatorics · Mathematics 2019-07-04 Minki Kim

A family $F$ of sets is said to satisfy the $(p,q)$-property if among any $p$ sets of $F$ some $q$ intersect. The celebrated $(p,q)$-theorem of Alon and Kleitman asserts that any family of compact convex sets in $\mathbb{R}^d$ that…

Combinatorics · Mathematics 2017-12-14 Chaya Keller , Shakhar Smorodinsky

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…

Metric Geometry · Mathematics 2021-01-25 Attila Jung , Márton Naszódi

A family of sets has the $(p,q)$ property if among any $p$ members of the family some $q$ have a nonempty intersection. It is shown that for every $p\ge q\ge d+1$ there is a $c=c(p,q,d)<\infty$ such that for every family $\scr F$ of…

Metric Geometry · Mathematics 2016-09-06 Noga Alon , Daniel J. Kleitman

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…

Combinatorics · Mathematics 2021-10-05 Balázs Keszegh

A family $\mathcal{F}$ of sets satisfies the $(p,q)$-property if among every $p$ members of $\mathcal{F}$, some $q$ can be pierced by a single point. The celebrated $(p,q)$-theorem of Alon and Kleitman asserts that for any $p \geq q \geq…

Combinatorics · Mathematics 2025-10-17 Chaya Keller , Micha A. Perles

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…

Metric Geometry · Mathematics 2015-10-27 David Rolnick , Pablo Soberón

We prove a fractional Helly theorem for $k$-flats intersecting fat convex sets. A family $\mathcal{F}$ of sets is said to be $\rho$-fat if every set in the family contains a ball and is contained in a ball such that the ratio of the radii…

Combinatorics · Mathematics 2024-12-09 Attila Jung , Dömötör Pálvölgyi

We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the…

Combinatorics · Mathematics 2020-05-05 Sherry Sarkar , Alexander Xue , Pablo Soberón

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…

Metric Geometry · Mathematics 2020-09-08 Travis Dillon , Pablo Soberón

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…

Combinatorics · Mathematics 2026-04-07 Wei Rao

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…

Combinatorics · Mathematics 2025-02-18 Andreas F. Holmsen

The colorful Helly theorem and Tverberg's theorem are fundamental results in discrete geometry. We prove a theorem which interpolates between the two. In particular, we show the following for any integers $d \geq m \geq 1$ and $k$ a prime…

Combinatorics · Mathematics 2024-03-25 Michael Gene Dobbins , Andreas F. Holmsen , Dohyeon Lee
‹ Prev 1 2 3 10 Next ›