combinatorics / Graph Theory, Topological Combinatorics
Norine conjectured that every red-blue edge-colouring of the $n$-dimensional hypercube $Q_n$ in which antipodal edges get opposite colours contains a monochromatic path from some vertex to its antipode. The paper proves it, via a chain-level Borsuk–Ulam obstruction.
Temporal state
No reconciled state yet.
Append-only history
Norine conjectured that every red-blue edge-colouring of the $n$-dimensional hypercube $Q_n$ in which antipodal edges get opposite colours contains a monochromatic path from some vertex to its antipode. The paper proves it, via a chain-level Borsuk–Ulam obstruction.
Research memory
Norine conjectured that every red-blue edge-colouring of the $n$-dimensional hypercube $Q_n$ in which antipodal edges get opposite colours contains a monochromatic path from some vertex to its antipode. The paper proves it, via a chain-level Borsuk–Ulam obstruction.
Evidence graph
No public relationships recorded yet.