Long paths and cycles in subgraphs of the cube


Let Qn denote the graph of the n-dimensional cube with vertex set {0, 1} in which two vertices are adjacent if they differ in exactly one coordinate. Suppose G is a subgraph of Qn with average degree at least d. How long a path can we guarantee to find in G? Our aim in this paper is to show that G must contain an exponentially long path. In fact, we show… (More)
DOI: 10.1007/s00493-013-2736-1


6 Figures and Tables

Cite this paper

@article{Long2013LongPA, title={Long paths and cycles in subgraphs of the cube}, author={Eoin Long}, journal={Combinatorica}, year={2013}, volume={33}, pages={395-428} }