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 and there exists an integer such that the following holds. If is a finite family of subsets of such that for any and every then has Helly number at most . Here denotes the reduced -Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these 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 , some well-behaved chain map .
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