A general bridge theorem for self-avoiding walks

DOI10.1016/j.disc.2020.112092zbMath1448.05146arXiv1902.08493OpenAlexW3080262661MaRDI QIDQ2005683

Christian Lindorfer

Publication date: 8 October 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.08493

zbMATH Keywords

self-avoiding walksbridgesgrandparent graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Infinite graphs (05C63)

Cites Work

• Unnamed Item
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The self-avoiding walk.
• Amenability, unimodularity, and the spectral radius of random walks on infinite graphs
• Automorphism groups of graphs as topological groups
• Self-avoiding walks and amenability
• Locality of connective constants
• The language of self-avoiding walks
• Connective constants and height functions for Cayley graphs
• Lectures on Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE

This page was built for publication: A general bridge theorem for self-avoiding walks