ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, with vertex set V(G)V(G), minimum degree δ(G)\delta(G), and pebbling numbers π∗(G)\pi^*(G) and π2∗(G)\pi_2^*(G) denoting its optimal and 22-restricted optimal pebbling numbers, respectively.

Half-minimum-degree conjecture. If

δ(G)≥12∣V(G)∣,\delta(G)\geq \frac{1}{2}|V(G)|,

then

π2∗(G)=π∗(G).\pi_2^*(G)=\pi^*(G).

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 22-restricted pebble distribution of size 44 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.