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 (Q839909)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A short proof of w₁^n (Hom(C₂r+1, K_n+2)) = 0 for all n and a graph colouring theorem by Babson and Kozlov |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 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 |
scientific article |
Statements
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 (English)
0 references
3 September 2009
0 references
0 references
0.8371071219444275
0 references
0.8111817240715027
0 references
0.8101879954338074
0 references
0.8094110488891602
0 references
0.8035738468170166
0 references
