Self-avoiding walk
= Self-avoiding walk
{wiki}
An $n$-step <self-avoiding walk> on a <graph> is a sequence $v_0,\ldots,v_n$ of distinct <graph vertices> with an <edge> between successive <graph vertices>. It is a <graph path> with $n$ <edges> and $n+1$ <graph vertices>. On a transitive <graph>, the exponential growth rate of rooted <self-avoiding walk> counts is the <connective constant>.