A short proof of w 1 n (Hom(C 2r+1, K n+2)) = 0 for all n and A graph colouring theorem by Babson and Kozlov
- 74 Downloads
We show that the n-th power of the first Stiefel-Whitney class of the ℤ2-action on the graph complex Hom(C 2r+1, K n+2) is zero, confirming a conjecture by Babson and Kozlov. This yields a considerably simplified proof of their graph colouring theorem, which is also known as the Lovsz conjecture.
KeywordsChromatic Number Graph Colouring Order Complex Cubical Complex Graph Complex
Unable to display preview. Download preview PDF.
- [Cso05]P. Csorba, Non-tidy Spaces and Graph Colorings, PhD thesis, ETH Zurich, 2005.Google Scholar
- [Koz07]D. N. Kozlov, Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes, in Geometric Combinatorics, (Miller, E., Reiner, V., and Sturmfels, B., eds.), IAS/Park City Math. Ser., vol. 13, American Mathematical Society, Providence, RI, 2007, pp. 249–315.Google Scholar
- [Sch06]C. Schultz, Graph colourings, spaces of edges and spaces of circuits, Advances in Mathematics, 2006, submitted. math.CO/0606763.Google Scholar
- [Živ05]R. T. Živaljević, Combinatorial groupoids, cubical complexes, and the Lovász conjecture, 2005, 28 pp. math.CO/0510204Google Scholar