Krivelevich–Samotij percolation conjecture
Statement
Let be a finite graph, let denote the spectral radius of its adjacency matrix, and let be obtained from by retaining each edge independently with probability . The conjecture asserts that the critical probability for the emergence of large connected components is : above , typically contains a connected component of order , whereas below every connected component has order at most .
Record
- Added
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.