pith. machine review for the scientific record. sign in

arxiv: 1301.2195 · v1 · submitted 2013-01-10 · 🧮 math.CO

Recognition: unknown

Long geodesics in subgraphs of the cube

Authors on Pith no claims yet
classification 🧮 math.CO
keywords geodesiccontainlongmustantipodalaveragebestcolourings
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.