Sciweavers

DM
1998
73views more  DM 1998»
13 years 11 months ago
On constructing snakes in powers of complete graphs
We prove the conjecture of Abbott and Katchalski that for every m ≥ 2 there is a positive constant λm such that S(Kd mn) ≥ λmnd−1 S(Kd−1 m ) where S(Kd m) is the length o...
Jerzy Wojciechowski