ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite graph, let λ(G)\lambda(G) denote the spectral radius of its adjacency matrix, and let GpG_p be obtained from GG by retaining each edge independently with probability pp. The conjecture asserts that the critical probability for the emergence of large connected components is pc(G)=1/λ(G)p_c(G)=1/\lambda(G): above p=1/λ(G)p=1/\lambda(G), GpG_p typically contains a connected component of order Ω(λ(G))\Omega(\lambda(G)), whereas below p=1/λ(G)p=1/\lambda(G) every connected component has order at most O(∣V(G)∣)O(\sqrt{|V(G)|}).

Record

Added
Links

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.