Pages that link to "Item:Q2851437"
From MaRDI portal
The following pages link to \(D\)-collapsibility is NP-complete for \(d \geq 4\) (Q2851437):
Displaying 10 items.
- A counterexample to Wegner's conjecture on good covers (Q664352) (← links)
- Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
- The worst way to collapse a simplex (Q2055286) (← links)
- Collapsibility of simplicial complexes of hypergraphs (Q2327224) (← links)
- The threshold for \(d\)-collapsibility in random complexes (Q2795743) (← links)
- Determining Whether a Simplicial 3-Complex Collapses to a 1-Complex Is NP-Complete (Q5458885) (← links)
- Oriented matroids and combinatorial neural codes (Q5886261) (← links)
- Complexes of graphs with bounded independence number (Q5918951) (← links)
- Recognition of collapsible complexes is NP-complete (Q5964219) (← links)
- (Q6124760) (← links)