English

Bounding Helly numbers via Betti numbers

Combinatorics 2016-11-11 v3 Computational Geometry Discrete Mathematics Algebraic Topology

Abstract

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 bb and dd there exists an integer h(b,d)h(b,d) such that the following holds. If F\mathcal F is a finite family of subsets of Rd\mathbb R^d such that β~i(G)b\tilde\beta_i\left(\bigcap\mathcal G\right) \le b for any GF\mathcal G \subsetneq \mathcal F and every 0id/210 \le i \le \lceil d/2 \rceil-1 then F\mathcal F has Helly number at most h(b,d)h(b,d). Here β~i\tilde\beta_i denotes the reduced Z2\mathbb Z_2-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these d/2\lceil d/2 \rceil first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex KK, some well-behaved chain map C(K)C(Rd)C_*(K) \to C_*(\mathbb R^d).

Cite

@article{arxiv.1310.4613,
  title  = {Bounding Helly numbers via Betti numbers},
  author = {Xavier Goaoc and Pavel Paták and Zuzana Patáková and Martin Tancer and Uli Wagner},
  journal= {arXiv preprint arXiv:1310.4613},
  year   = {2016}
}

Comments

29 pages, 8 figures

R2 v1 2026-06-22T01:48:42.066Z