ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥1d\ge 1. For a finite graph G\mathbf{G}, let its diameter be the maximum distance between two vertices, let its connectivity be the minimum number of vertices whose removal disconnects the graph, and call G\mathbf{G} Class 00 when its pebbling number f(G)f(\mathbf{G}) equals its number of vertices. Clarke–Hochberg–Hurlbert conjecture. For each d≥1d\ge 1, there exists a least positive integer k(d)k(d) such that every graph of diameter dd and connectivity at least k(d)k(d) belongs to Class 00. The conjecture concerns a threshold connectivity guaranteeing the Class 00 pebbling property; the source indicates that Clarke, Hochberg and Hurlbert formulated it, while the surrounding text does not establish its resolution.

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.