The probabilistic Graham product conjecture
For graphs and , let denote the smallest number of pebbles in a randomly generated configuration that is solvable with probability at least . Probabilistic Graham conjecture. There is a universal constant such that
This is a probabilistic analogue of Graham's Conjecture for pebbling, which predicts a multiplicative bound for the pebbling number of Cartesian products.
References
Status
- Refuted: Neal Bushaw and Nathan Kettle. Thresholds for Pebbling on Grids (arXiv, 2023) https://arxiv.org/abs/2309.01762
Source: Neal Bushaw and Nathan Kettle, “Thresholds for Pebbling on Grids”, arXiv:2309.01762 (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.