IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-44479-6_17.html
   My bibliography  Save this book chapter

Bounding Helly Numbers via Betti Numbers

In: A Journey Through Discrete Mathematics

Author

Listed:
  • Xavier Goaoc

    (Université Paris-Est Marne-la-Vallée)

  • Pavel Paták

    (Charles University, Department of Algebra)

  • Zuzana Patáková

    (Charles University, Department of Applied Mathematics)

  • Martin Tancer

    (Charles University, Department of Applied Mathematics)

  • Uli Wagner

    (IST Austria)

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 b and d there exists an integer h(b, d) such that the following holds. If ℱ $$\mathcal{F}$$ is a finite family of subsets of ℝ d $$\mathbb{R}^{d}$$ such that β ̃ i ⋂ 𝒢 ≤ b $$\tilde{\beta }_{i}\left (\bigcap \mathcal{G}\right ) \leq b$$ for any 𝒢 ⊊ ℱ $$\mathcal{G} \subsetneq \mathcal{F}$$ and every 0 ≤ i ≤ ⌈d∕2⌉− 1 then ℱ $$\mathcal{F}$$ has Helly number at most h(b, d). Here β ̃ i $$\tilde{\beta }_{i}$$ denotes the reduced ℤ 2 $$\mathbb{Z}_{2}$$ -Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these ⌈d∕2⌉ 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 K, some well-behaved chain map C ∗ ( K ) → C ∗ ( ℝ d ) $$C_{{\ast}}(K) \rightarrow C_{{\ast}}(\mathbb{R}^{d})$$ .

Suggested Citation

  • Xavier Goaoc & Pavel Paták & Zuzana Patáková & Martin Tancer & Uli Wagner, 2017. "Bounding Helly Numbers via Betti Numbers," Springer Books, in: Martin Loebl & Jaroslav Nešetřil & Robin Thomas (ed.), A Journey Through Discrete Mathematics, pages 407-447, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-44479-6_17
    DOI: 10.1007/978-3-319-44479-6_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-319-44479-6_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.