Uniqueness of percolation on graphs roughly isometric to lattices
Statement
Prove that Bernoulli percolation has at most one infinite cluster on every bounded-degree graph roughly isometric to .
Record
- Source
- 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.