2000 character limit reached
Long geodesics in subgraphs of the cube
Published 10 Jan 2013 in math.CO | (1301.2195v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.