Generalized Graham pebbling product conjecture

About 22 years old · traced to

Let G1G_1 and G2G_2 be graphs, let p1,p2p_1,p_2 be positive integers, and let f(p1,p2)f_{(p_1,p_2)} denote the corresponding generalized pebbling number, with fpi(Gi)f_{p_i}(G_i) the one-factor generalized pebbling numbers. Generalized Graham conjecture. For all G1,G2,p1,p2G_1,G_2,p_1,p_2,

f(p1,p2)(G1□G2)≤fp1(G1)fp2(G2).f_{(p_1,p_2)}(G_1\Box G_2)\le f_{p_1}(G_1)f_{p_2}(G_2).

This is presented as a natural generalization of Graham's conjecture; its resolution is not specified in the supplied text.

References

Primary source

Glenn Hurlbert, “A Survey of Graph Pebbling”, arXiv:math/0406024 (2004).

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.