The self-avoiding-walk bunkbed question
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.
References
Status
- Refuted: Pengfei Tang. Maximum flow and self-avoiding walk on bunkbed graphs (arXiv, 2025) https://arxiv.org/abs/2502.06237
Source: Pengfei Tang, “Maximum flow and self-avoiding walk on bunkbed graphs”, arXiv:2502.06237 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.