Set partition complexes
From MaRDI portal
Publication:958232
Recommendations
Cites work
- scientific article; zbMATH DE number 3711961 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 3329602 (Why is no real title available?)
- scientific article; zbMATH DE number 2211584 (Why is no real title available?)
- A note on two multicolor Ramsey numbers
- 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
- A short proof of a conjecture on the connectivity of graph coloring complexes
- Additive combinatorics
- Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
- Combinatorial groupoids, cubical complexes, and the Lovász Conjecture
- Complexes of graph homomorphisms
- Graph colorings, spaces of edges and spaces of circuits
- Hom complexes and homotopy in the category of graphs
- Morse theory for cell complexes
- Proof of the Lovász conjecture
- Simplicial complexes of graphs
- The homotopy type of complexes of graph homomorphisms between cycles
- The universality of Hom complexes of graphs
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)