The snake-in-the-box problem: A new uppe
β
Hunter S. Snevily
π
Article
π
1994
π
Elsevier Science
π
English
β 453 KB
We give a new upper bound for the length of the largest induced cycle in the hypercube. ## 1. Introduction Let G1 and Gz be two graphs. The Cartesian product G= G1 x G2 has V(G)= V(G,) x V(G,), and two vertices (ul, u2) and (vl, u2) of G are adjacent if and only if either ul=vl and uzuz~E(G2) or u