The connective constant of non-simple transitive graphs of degree five
Grimmett and Li proved that the connective constant μ of an infinite, connected, Δ-regular, vertex-transitive graph satisfies μ ≥ √(Δ − 1) when the graph is simple, and also when it has multiple edges and Δ ≤ 4, and asked whether the second statement holds for Δ ≥ 5. We prove it for Δ = 5: every infinite, connected, 5-regular, vertex-transitive, loopless multigraph has μ ≥ 2, with equality for the bridge graph. The proof passes to the quotient by the atoms, the smallest finite vertex sets with the fewest boundary edges, where the branching inequality of Grimmett and Li holds. Each walk of the quotient lifts to many walks of the graph, counted by self-avoiding paths inside the atoms, and a convexity argument gives growth rate at least √(Δ − 1) under a condition on the atoms alone. For degree five the four possible atom types satisfy it.
Authors
- Yitzchak Shmalo (ORCID: https://orcid.org/0000-0002-2886-3049)
Institutions
- Hebrew University of Jerusalem (IL)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.5281/zenodo.24310112
- Primary Topic
- Stochastic processes and statistical mechanics
- Type
- preprint