Set partition complexes
From MaRDI portal
Publication:958232
DOI10.1007/S00454-008-9106-6zbMATH Open1151.05047OpenAlexW1997800468MaRDI QIDQ958232FDOQ958232
Authors: Alexander Engström 
Publication date: 2 December 2008
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9106-6
Recommendations
Cites Work
- Morse theory for cell complexes
- Additive combinatorics
- Simplicial complexes of graphs
- Title not available (Why is that?)
- Complexes of graph homomorphisms
- Proof of the Lovász conjecture
- Title not available (Why is that?)
- Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The universality of Hom complexes of graphs
- Combinatorial groupoids, cubical complexes, and the Lovász Conjecture
- Graph colorings, spaces of edges and spaces of circuits
- A short proof of \(w_{1}^n (\text{Hom}(C_{2r+1}, K_{n+2})) = 0\) for all \(n\) and a graph colouring theorem by Babson and Kozlov
- The homotopy type of complexes of graph homomorphisms between cycles
- A short proof of a conjecture on the connectivity of graph coloring complexes
- Hom complexes and homotopy in the category of graphs
- A note on two multicolor Ramsey numbers
Cited In (4)
This page was built for publication: Set partition complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958232)
