Diameter criterion for bounded finite-graph percolation thresholds
Statement
Let be a finite transitive graph, let denote its number of vertices, and let be its percolation threshold. Diameter criterion conjecture. There is a constant such that, whenever
then . The paper describes this condition as conjecturally sharp; the general assertion remains open.
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.