# A general bridge theorem for self-avoiding walks

## TL;DR

This paper establishes a general theorem linking the growth rates of self-avoiding walks and bridges on certain graphs, providing a method to compute the connective constant using bridge constants, exemplified on the Grandparent graph.

## Contribution

It introduces a universal bridge theorem connecting self-avoiding walk growth rates to bridge constants on graphs with height functions, enabling explicit calculations.

## Key findings

- Connective constant equals the maximum of increasing and decreasing bridge constants.
- The theorem applies to any graph with a height function.
- Calculated the connective constant for the Grandparent graph.

## Abstract

Let $X$ be an infinite, locally finite, connected, quasi-transitive graph without loops or multiple edges. A graph height function on $X$ is a map adapted to the graph structure, assigning to every vertex an integer, called height. Bridges are self-avoiding walks such that heights of interior vertices are bounded by the heights of the start- and end-vertex. The number of self-avoiding walks and the number of bridges of length $n$ starting at a vertex $o$ of $X$ grow exponentially in $n$ and the bases of these growth rates are called connective constant and bridge constant, respectively. We show that for any graph height function $h$ the connective constant of the graph is equal to the maximum of the two bridge constants given by increasing and decreasing bridges with respect to $h$. As a concrete example, we apply this result to calculate the connective constant of the Grandparent graph.