Pages that link to "Item:Q839909"

The following pages link to 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):

Displayed 4 items.

• Stiefel manifolds and coloring the pentagon (Q392810) ‎ (← links)
• Answers to some problems about graph coloring test graphs (Q482122) ‎ (← links)
• Set partition complexes (Q958232) ‎ (← links)
• Topology of Hom complexes and test graphs for bounding chromatic number (Q1758983) ‎ (← links)