ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG and HH be graphs. A nonnegative function on a graph assigns a nonnegative real number to each vertex. Let ω1\omega_1 be a nonnegative function on GG and ω2\omega_2 a nonnegative function on HH, and define ω\omega on the Cartesian product G×HG\times H by

ω((g,h))=ω1(g)ω2(h),g∈V(G), h∈V(H).\omega((g,h))=\omega_1(g)\omega_2(h),\qquad g\in V(G),\ h\in V(H).

The weighted cover pebbling number γω(G)\gamma_\omega(G) is the minimum number of pebbles sufficient to meet the vertex demands specified by ω\omega, regardless of the initial distribution. Weighted Graham-type conjecture. The weighted cover pebbling number satisfies

γω(G×H)≤γω1(G)γω2(H).\gamma_\omega(G\times H)\leq \gamma_{\omega_1}(G)\gamma_{\omega_2}(H).

This is proposed as a conjecture analogous to Graham's conjecture. The paper presents it after stating related open problems, and no resolution is supplied.

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.