Cubic graphs and the golden mean

DOI10.1016/J.DISC.2019.111638MaRDI QIDQ2279284zbMATH OpenOpenAlexFDO

Authors G. R. Grimmett, Zhongyang Li

Publication date 12 December 2019

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

connective constantcubic graphGrigorchuk groupself-avoiding walkTLF-planar graphtransitive graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: The connective constant $mu(G)$ of a graph $G$ is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. We investigate the validity of the inequality $mugephi$ for infinite, transitive, simple, cubic graphs, where $phi:=frac12(1+sqrt5)$ is the golden mean. The inequality is proved for several families of graphs including (i) Cayley graphs of infinite groups with three generators and strictly positive first Betti number, (ii) infinite, transitive, topologically locally finite (TLF) planar, cubic graphs, and (iii) cubic Cayley graphs with two ends. Bounds for $mu$ are presented for transitive cubic graphs with girth either $3$ or $4$, and for certain quasi-transitive cubic graphs.

Recommendations

• Self-avoiding walks and connective constants
• Bounds on connective constants of regular graphs
• Strict inequalities for connective constants of transitive graphs
• The Language of Self-Avoiding Walks
• Counting self-avoiding walks on free products of graphs

Cites work

• Bounds on connective constants of regular graphs
• Combinatorial curvature for planar graphs
• Connective constants and height functions for Cayley graphs
• Counting self-avoiding walks on free products of graphs
• Curvature, geometry and spectral properties of planar graphs
• Embedding Theorems for Groups
• Ends and amalgamated free products of groups
• Ends and free products of groups
• Ends of Groups and the Associated First Cohomology Groups
• Exponential growth rates of free and amalgamated products.
• Gauss-Bonnet formula, finiteness condition, and characterizations of graphs embedded in surfaces
• Geometric group theory
• scientific article; zbMATH DE number 3148803 (Why is no real title available?)
• scientific article; zbMATH DE number 3871642 (Why is no real title available?)
• scientific article; zbMATH DE number 4156474 (Why is no real title available?)
• scientific article; zbMATH DE number 3563392 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3381557 (Why is no real title available?)
• scientific article; zbMATH DE number 3088537 (Why is no real title available?)
• Lectures on self-avoiding walks
• Locality of connective constants
• Minimal exponential growth rates of metabelian Baumslag-Solitar groups and lamplighter groups
• Notes on the Schreier graphs of the Grigorchuk group
• On Burnside's problem on periodic groups
• On the girth of infinite graphs
• On torsion-free groups with infinitely many ends
• Probability on graphs. Random processes on graphs and lattices.
• Random Walks on Infinite Graphs and Groups
• Schreier graphs of Grigorchuk's group and a subshift associated to a nonprimitive substitution
• Self-avoiding walks and amenability
• Self-avoiding walks and connective constants
• Self-avoiding walks and the Fisher transformation
• Self-avoiding walks, the language of science, and Fibonacci numbers
• Solved and unsolved problems around one group.
• Some relations between analytic and geometric properties of infinite graphs
• Some topics in the dynamics of group actions on rooted trees.
• Strict inequalities for connective constants of transitive graphs
• THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLES
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The vertex-transitive TLF-planar graphs

Cited in

(11)

• Self-avoiding walk on nonunimodular transitive graphs
• Strict inequalities for connective constants of transitive graphs
• Self-avoiding walks and connective constants
• Self-avoiding walks and the Fisher transformation
• The set of connective constants of Cayley graphs contains a Cantor space
• Bounds on connective constants of regular graphs
• Ising percolation in the hyperbolic plane
• Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
• Self-avoiding walk is ballistic on graphs with more than one end
• Hyperbolic site percolation
• Positive speed self-avoiding walks on graphs with more than one end

This page was built for publication: Cubic graphs and the golden mean

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279284)