Generalized pebbling product conjecture for weighted stars

Let GG be a graph and n1n\ge 1. Let k,lNk,l\in\mathbb{N} satisfy 2kl2\le k\le l. The pebbling number of a target vertex tt is denoted by π(G,t)\pi(G,t), and τ2,l(G,t)\tau_{2,l}(G,t) denotes the corresponding two-pebbling parameter with edge weight ll. Let Rn(k)R_n^{(k)} be the star-like directed graph with nn leaves, all edges directed toward its central vertex ss and having weight kk. If

π(G,t)pandτ2,l(G,t)2p,\pi(G,t)\le p\qquad\text{and}\qquad\tau_{2,l}(G,t)\le 2p,

then the following bounds hold:

Generalized weighted-star pebbling conjecture.

π(Rn(k)\scalebox0.6G,(s,t))(nkn+1)p\pi\left(R_n^{(k)}\mathbin{\hspace{2pt}\raisebox{1pt}{\scalebox{0.6}{$\square$}}\hspace{2pt}}G,(s,t)\right)\le (nk-n+1)p

and

τ2,k(Rn(k)\scalebox0.6G,(s,t))(nkn+1)2p.\tau_{2,k}\left(R_n^{(k)}\mathbin{\hspace{2pt}\raisebox{1pt}{\scalebox{0.6}{$\square$}}\hspace{2pt}}G,(s,t)\right)\le (nk-n+1)\cdot 2p.

The claim generalizes the preceding product results for arrow graphs and hypercubes, and asks whether the weighted-star analogue of the known pebbling-number formula extends to products with an arbitrary graph satisfying the stated pebbling and two-pebbling bounds.

Sources & referencesView supporting material

Primary source

Herman Bergwerf, “An Exploration of Graph Pebbling”, arXiv:2303.04590 (2023).

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.