We introduce a notion of strong d-collapsibility. Using this notion, we simplify the proof of Matoušek and the author showing that the nerve of a family of sets of size at most d is d-collapsible
AbstractWe study several standard combinatorial constructions on simplicial complexes (e.g., barycen...
In 1950 when JHC Whitehead introduced the idea of elementary collapse of simplicial complexes and t...
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decomposi...
We introduce a notion of strong d-collapsibility. Using this notion, we simplify the proof of Matou...
This paper illustrates how convexity hypotheses help collapsing simplicial complexes. We first consi...
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical sim...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
Abstract. We introduce the theory of strong homotopy types of simplicial complexes. Similarly to cla...
In this paper we extend the works of Tancer, Malgouyres and Franc\ue9s, showing that (d, k) -Collaps...
In this paper we extend the works of Tancer, Malgouyres and Francés, showing that (d, k) -Collapsibi...
The collapsibility number of simplicial complexes was introduced by Wegner in order to understand th...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means o...
AbstractWe study several standard combinatorial constructions on simplicial complexes (e.g., barycen...
In 1950 when JHC Whitehead introduced the idea of elementary collapse of simplicial complexes and t...
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decomposi...
We introduce a notion of strong d-collapsibility. Using this notion, we simplify the proof of Matou...
This paper illustrates how convexity hypotheses help collapsing simplicial complexes. We first consi...
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical sim...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
An abstract simplicial complex is said to be $d$-representable if it records the intersection patter...
Abstract. We introduce the theory of strong homotopy types of simplicial complexes. Similarly to cla...
In this paper we extend the works of Tancer, Malgouyres and Franc\ue9s, showing that (d, k) -Collaps...
In this paper we extend the works of Tancer, Malgouyres and Francés, showing that (d, k) -Collapsibi...
The collapsibility number of simplicial complexes was introduced by Wegner in order to understand th...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
A simplicial complex is d-representable if it is the nerve of a collection of convex sets in Rd. Cla...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means o...
AbstractWe study several standard combinatorial constructions on simplicial complexes (e.g., barycen...
In 1950 when JHC Whitehead introduced the idea of elementary collapse of simplicial complexes and t...
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decomposi...
DOI
Add to ORKG