ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite transitive graph, let ∣G∣|G| denote its number of vertices, and let pGp^G be its percolation threshold. Diameter criterion conjecture. There is a constant C<1C<1 such that, whenever

diameter⁡(G)<∣G∣log⁡∣G∣,\operatorname{diameter}(G)<\frac{|G|}{\log|G|},

then pG<Cp^G<C. 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 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.