Dimension gaps between representability and collapsibility
From MaRDI portal
Publication:1042449
DOI10.1007/s00454-008-9091-9zbMath1201.52003arXiv0803.3520OpenAlexW2035017213WikidataQ105336424 ScholiaQ105336424MaRDI QIDQ1042449
Martin Tancer, Ji{ří} Matoušek
Publication date: 14 December 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.3520
Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Combinatorial aspects of simplicial complexes (05E45)
Related Items (8)
On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs ⋮ The \(v\)-number and Castelnuovo-Mumford regularity of graphs ⋮ Helly’s theorem: New variations and applications ⋮ A counterexample to Wegner's conjecture on good covers ⋮ Non-representability of finite projective planes by convex sets ⋮ Collapsibility of non-cover complexes of graphs ⋮ Complexes of graphs with bounded independence number ⋮ Collapsibility of simplicial complexes of hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A topological colorful Helly theorem
- Intersections of Leray complexes and regularity of monomial ideals
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditions
- Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditions
- A generalization of Caratheodory's theorem
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- d-collapsing and nerves of families of convex sets
- A short proof of an interesting Helly-type theorem
- A Problem of Geometry in R n
- On the chromatic number of Kneser hypergraphs
- Komplexe in euklidischen Räumen
This page was built for publication: Dimension gaps between representability and collapsibility
