Clarke–Hochberg–Hurlbert connectivity conjecture for graph pebbling
Statement
Let . For a finite graph , 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 Class when its pebbling number equals its number of vertices. Clarke–Hochberg–Hurlbert conjecture. For each , there exists a least positive integer such that every graph of diameter and connectivity at least belongs to Class . The conjecture concerns a threshold connectivity guaranteeing the Class 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.