Further results on snakes in powers of complete graphs

AbstractBy a snake in a finite graph G is meant a cycle without chords. Denoted by S(G) the length of a longest snake in G. In this paper we obtain a new lower bound for S(G) in the case where G is the product of d copies of the complete graph on n vertices