Recognition: unknown
Long geodesics in subgraphs of the cube
classification
🧮 math.CO
keywords
geodesiccontainlongmustantipodalaveragebestcolourings
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.