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
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / author | |||
| Property / author: Carsten A. Schultz / rank | |||
| Property / author | |||
| Property / author: Carsten A. Schultz / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990464011 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0507346 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Topological obstructions to graph colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexes of graph homomorphisms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Proof of the Lovász conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3440034 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cobounding odd cycle colorings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5432047 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kneser's conjecture, chromatic number, and homotopy / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Small models of graph colouring manifolds and the Stiefel manifolds \(\Hom(C_{5},K_n)\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Canonical homeomorphisms of posets / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 23: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
