Set partition complexes

DOI10.1007/s00454-008-9106-6zbMath1151.05047OpenAlexW1997800468MaRDI QIDQ958232

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

zbMATH Keywords

Ramsey theorytopological combinatoricshom complexset partition complex

Mathematics Subject Classification ID

Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 universality of Hom complexes of graphs
• Combinatorial groupoids, cubical complexes, and the Lovász Conjecture
• Graph colorings, spaces of edges and spaces of circuits
• Morse theory for cell complexes
• Complexes of graph homomorphisms
• Simplicial complexes of graphs
• Proof of the Lovász conjecture
• The homotopy type of complexes of graph homomorphisms between cycles
• A note on two multicolor Ramsey numbers
• A short proof of a conjecture on the connectivity of graph coloring complexes
• Hom complexes and homotopy in the category of graphs

This page was built for publication: Set partition complexes