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): Difference between revisions
From MaRDI portal
Latest revision as of 22:23, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
