 Self-avoiding walk

An $n$-step self-avoiding walk on a graph is a sequence $v_0,\dots ,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.

A self-avoiding walk (SAW) is a mathematical and combinatorial object used primarily in statistical mechanics and theoretical physics, as well as in computer science and graph theory. It is defined as a path that does not visit the same point more than once.