Generalized Graham pebbling product conjecture
Let and be graphs, let be positive integers, and let denote the corresponding generalized pebbling number, with the one-factor generalized pebbling numbers. Generalized Graham conjecture. For all ,
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.