English
Related papers

Related papers: On a topological fractional Helly theorem

200 papers

We prove general topological Radon-type theorems for sets in $\mathbb R^d$ or on a surface. Combined with a recent result of Holmsen and Lee, we also obtain fractional Helly theorem, and consequently the existence of weak $\varepsilon$-nets…

Combinatorics · Mathematics 2024-12-04 Zuzana Patáková

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…

Computational Geometry · Computer Science 2024-11-28 Marguerite Bin

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…

Combinatorics · Mathematics 2011-02-25 Éric Colin de Verdière , Grégory Ginot , Xavier Goaoc

We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers $b$ and $d$ there exists an integer $h(b,d)$ such that the following…

Combinatorics · Mathematics 2016-11-11 Xavier Goaoc , Pavel Paták , Zuzana Patáková , Martin Tancer , Uli Wagner

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…

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

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

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á

We prove that for a topological space X with the property that $H_p(U)=0$ for $p\geq d$ and every open subset $U$ of $X$, a finite family of open sets in $X$ has nonempty intersection if for any subfamily of size $j$, $1\leq j \leq d+1$,…

Metric Geometry · Mathematics 2014-07-09 Luis Montejano

Let $\mathbb{F}$ be a fixed field and let $X$ be a simplicial complex on the vertex set $V$. The Leray number $L(X;\mathbb{F})$ is the minimal $d$ such that for all $i \geq d$ and $S \subset V$, the induced complex $X[S]$ satisfies…

Combinatorics · Mathematics 2021-02-23 Gil Kalai , Roy Meshulam

Helly's theorem and its variants show that for a family of convex sets in Euclidean space, local intersection patterns influence global intersection patterns. A classical result of Eckhoff in 1988 provided an optimal fractional Helly…

Combinatorics · Mathematics 2024-02-09 Debsoumya Chakraborti , Jaehoon Kim , Jinha Kim , Minki Kim , Hong Liu

A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R^d; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d-1 that is contained…

Combinatorics · Mathematics 2008-03-26 Jiri Matousek , Martin Tancer

We discuss recent progress on topological Helly-type theorems and their variants. We provide an overview of two different proof techniques, one based on the nerve lemma, while the other on non-embeddability.

Computational Geometry · Computer Science 2026-02-10 Pavel Paták , Zuzana Patáková

In this note we show that a particular homological nerve theorem, which was originally proved for a finite cover of a simplicial complex by subcomplexes, also holds for an open cover of an arbitrary topological space. The motivation for…

Algebraic Topology · Mathematics 2022-10-04 Patrick Gillespie

We make the first step towards a "nerve theorem" for graphs. Let $G$ be a simple graph and let $\mathcal{F}$ be a family of induced subgraphs of $G$ such that the intersection of any members of $\mathcal{F}$ is either empty or connected. We…

Combinatorics · Mathematics 2019-07-04 Andreas F. Holmsen , Minki Kim , Seunghun Lee

The nerve theorem is a basic result of algebraic topology that plays a central role in computational and applied aspects of the subject. In topological data analysis, one often needs a nerve theorem that is functorial in an appropriate…

Algebraic Topology · Mathematics 2025-06-04 Ulrich Bauer , Michael Kerber , Fabian Roll , Alexander Rolle

Let $\mathcal{F}$ be a family of $n$ axis-parallel boxes in $\mathbb{R}^d$ and $\alpha\in (1-1/d,1]$ a real number. There exists a real number $\beta(\alpha )>0$ such that if there are $\alpha {n\choose 2}$ intersecting pairs in…

Metric Geometry · Mathematics 2015-02-25 I. Bárány , F. Fodor , A. Martínez-Pérez , L. Montejano , D. Oliveros , A. Pór

Let X be a simplicial complex on the vertex set V. The rational Leray number L(X) of X is the minimal d such that the rational reduced homology of any induced subcomplex of X vanishes in dimensions d and above. Let \pi be a simplicial map…

Combinatorics · Mathematics 2014-02-26 Gil Kalai , Roy Meshulam

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

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

Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…

Combinatorics · Mathematics 2024-11-26 Pavel Paták
‹ Prev 1 2 3 10 Next ›