Asymptotic optimal pebbling conjecture for multiples of seven-wide staircase graphs
Statement
Let be the staircase graph of width , and let denote its optimal pebbling number.
Multiples-of-seven staircase conjecture. For all ,
The conjecture is motivated by duplicating an optimal distribution for times. It predicts the asymptotically optimal pebbling size for staircase widths that are positive multiples of seven.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.