ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a positive integer n≥3n\geq 3, let Qn−1Q_{n-1} be the (n−1)(n-1)-dimensional hypercube, and let GnG_n be the graph obtained by attaching a root rr to an arbitrary vertex of Qn−1Q_{n-1} through an extra pendant edge. Let d(v,r)d(v,r) denote graph distance from vv to rr, and define a weight function wnw_n on GnG_n by

wn(r)=0,wn(v)=1d(v,r)for all v≠r.w_n(r)=0,\qquad w_n(v)=\frac{1}{d(v,r)}\quad\text{for all }v\neq r.

Validity conjecture. The weight function wnw_n is valid.

This claim concerns the construction of non-tree weight functions used to obtain pebbling bounds for hypercubes. The supplied text does not state whether the claim has been proved or remains open.

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.