Antipodal paths: a short proof by counting intersections
We give a short elementary proof of Norine's antipodal-coloring theorem: every red--blue edge coloring of a hypercube in which antipodal edges have opposite colors contains a monochromatic path joining antipodal vertices.
Authors
- Valjakas Djaljapayan
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16243
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint