Long geodesics in subgraphs of the cube
Combinatorics
2013-01-11 v1
Abstract
A path in the hypercube is said to be a geodesic if no two of its edges are in the same direction. Let be a subgraph of with average degree . How long a geodesic must contain? We show that must contain a geodesic of length . This result, which is best possible, strengthens a theorem of Feder and Subi. It is also related to the `antipodal colourings' conjecture of Norine.
Cite
@article{arxiv.1301.2195,
title = {Long geodesics in subgraphs of the cube},
author = {Imre Leader and Eoin Long},
journal= {arXiv preprint arXiv:1301.2195},
year = {2013}
}
Comments
8 pages