A counterexample to Wegner's conjecture on good covers
DOI10.1007/S00454-011-9356-6zbMATH Open1278.52004arXiv1008.1895OpenAlexW2009406359WikidataQ123233571 ScholiaQ123233571MaRDI QIDQ664352FDOQ664352
Publication date: 1 March 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.1895
Recommendations
- Dimension gaps between representability and collapsibility
- \(d\)-collapsibility is NP-complete for \(d \geq 4\)
- scientific article; zbMATH DE number 6470115
- When Convexity Helps Collapsing Complexes
- \(D\)-collapsibility is NP-complete for \(d \geq 4\)
- Families of convex sets having convex union
- Systolic simplicial complexes are collapsible
- On critical kernels
- Helly numbers of acyclic families
- Recognition of collapsible complexes is NP-complete
Simplicial sets and complexes in algebraic topology (55U10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Helly-type theorems and geometric transversal theory (52A35)
Cites Work
- Title not available (Why is that?)
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- d-collapsing and nerves of families of convex sets
- d-collapsibility is NP-complete for d greater or equal to 4
- A topological colorful Helly theorem
- Dimension gaps between representability and collapsibility
Cited In (1)
This page was built for publication: A counterexample to Wegner's conjecture on good covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664352)