activity
20042006
most citedA 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

6 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing 2006Show all

1 paper · 1 filter

math.CO2006★ 3 cited

Graph colourings, spaces of edges and spaces of circuits

Carsten Schultz

By Lovasz' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from below by the index of the Z_2-space Hom(K_2,G) plus two. We show that the cohomological…