The self-avoiding-walk bunkbed question
Statement
Suppose is a finite, connected, simple graph. For , let be the set of self-avoiding walks from to , and let denote the corresponding set on . Self-avoiding-walk bunkbed question. Is it true that for all distinct ,
The question has a negative answer in general: the inequality fails for ladder graphs, although it holds for complete bunkbed graphs for all by the stated theorem. Therefore the proposed assertion is refuted.
Record
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.