ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pc(n)p_c(n) denote the critical probability for jigsaw percolation on the ring puzzle graph with an Erdős–Rényi people graph. Critical-constant conjecture. The leading constant in the asymptotic expansion of pc(n)p_c(n) satisfies

c1=π26.c_1=\frac{\pi^2}{6}.

This conjecture specifies the leading constant in the preceding proposed expansion for the critical probability; the source gives no 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.