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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Antipodal paths: a short proof by counting intersections

Valjakas Djaljapayan
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

Antipodal paths: a short proof by counting intersections

Valjakas Djaljapayan
preprint en

Abstract

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.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon