Set Partition Complexes

The Hom complexes were introduced by Lovász to study topological obstructions to graph colorings. The vertices of Hom(G,Kn) are the n-colorings of the graph G, and a graph coloring is a partition of the vertex set into independent sets. Replacing the independence condition with any hereditary condition defines a set partition complex. We show how coloring questions arising from, for example, Ramsey theory can be formulated with set partition complexes.It was conjectured by Babson and Kozlov, and proved by Čukić and Kozlov, that Hom(G,Kn) is (n−d−2)-connected, where d is the maximal degree of a vertex of G. We generalize this to set partition complexes.

[1]  J. Jonsson.  Simplicial complexes of graphs , 2007 .

[2]  Stephen Weingram,et al.  The Topology of CW Complexes , 1969 .

[3]  Higher connectivity of graph coloring complexes , 2004, math/0410335.

[4]  Graph colorings, spaces of edges and spaces of circuits☆ , 2006, math/0606763.

[5]  Anton Dochtermann,et al.  The universality of Hom complexes of graphs , 2009, Comb..

[6]  Rade T. Zivaljevic.  Combinatorial Groupoids, Cubical Complexes, and the Lovász Conjecture , 2009, Discret. Comput. Geom..

[7]  Anton Dochtermann,et al.  Homotopy groups of Hom complexes of graphs , 2007, J. Comb. Theory, Ser. A.

[8]  Alexander Engström.  A short proof of a conjecture on the connectivity of graph coloring complexes , 2006 .

[9]  Ramsey Theory,et al.  Ramsey Theory , 2020, Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic.

[10]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[11]  Carsten Schultz.  A short proof of w1n (Hom(C2r+1, Kn+2)) = 0 for all n and A graph colouring theorem by Babson and Kozlov , 2005 .

[12]  E. Babson,et al.  Complexes of graph homomorphisms , 2003, math/0310056.

[14]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[15]  Dmitry N. Kozlov,et al.  Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes , 2005 .

[16]  R. Forman.  Morse Theory for Cell Complexes , 1998 .

[17]  A. Björner.  Topological methods , 1996 .

[18]  Dmitry N. Kozlov,et al.  Proof of the Lovász conjecture , 2004 .

[19]  Anton Dochtermann.  Hom complexes and homotopy theory in the category of graphs , 2009, Eur. J. Comb..

[20]  Dmitry N. Kozlov,et al.  Homotopy Type of Complexes of Graph Homomorphisms between Cycles , 2006, Discret. Comput. Geom..