The half-minimum-degree conjecture for restricted optimal pebbling
Statement
Let be a graph, with vertex set , minimum degree , and pebbling numbers and denoting its optimal and -restricted optimal pebbling numbers, respectively.
Half-minimum-degree conjecture. If
then
Graphs whose minimum degree is at least half their order have diameter at most two, so the conjecture reduces to proving the existence of a solvable -restricted pebble distribution of size for every such graph. The source states that this threshold was not determined and presents this claim as the next conjecture.
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.