English

Long geodesics in subgraphs of the cube

Combinatorics 2013-01-11 v1

Abstract

A path in the hypercube QnQ_n is said to be a geodesic if no two of its edges are in the same direction. Let GG be a subgraph of QnQ_n with average degree dd. How long a geodesic must GG contain? We show that GG must contain a geodesic of length dd. This result, which is best possible, strengthens a theorem of Feder and Subi. It is also related to the `antipodal colourings' conjecture of Norine.

Keywords

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