Golden-mean lower-bound conjecture for connective constants of infinite vertex-transitive cubic graphs
Statement
For every infinite, connected, vertex-transitive, cubic graph , let denote the number of self-avoiding walks of length starting at a vertex , and let the connective constant be . Then , where is the golden ratio.
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.