The critical-constant conjecture for ring-graph jigsaw percolation
Statement
Let 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 satisfies
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.