On self-avoiding walks on certain grids and the connective constant

Abstract

We consider self-avoiding walks on the square grid graph. More precisely we investigate the number of walks of a fixed length on Z×{-1,0,1}. Using combinatorial arguments we derive the related generating function. We present the asymptotic estimates of the number of walks in consideration, as well as important connective constants.