ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Suppose G=(V,E)G=(V,E) is a finite, connected, simple graph. For x,y∈Vx,y\in V, let S(x,y)\mathscr{S}(x,y) be the set of self-avoiding walks from xx to yy, and let S(ui,vj)\mathscr{S}(u_i,v_j) denote the corresponding set on G×K2G\times K_2. Self-avoiding-walk bunkbed question. Is it true that for all distinct u,v∈V(G)u,v\in V(G),

∣S(u0,v0)∣≤∣S(u0,v1)∣?\big|\mathscr{S}(u_0,v_0)\big|\leq \big|\mathscr{S}(u_0,v_1)\big|?

The question has a negative answer in general: the inequality fails for ladder graphs, although it holds for complete bunkbed graphs Kn×K2K_n\times K_2 for all n≥3n\geq 3 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.