Benjamini–Häggström–Mossel conjecture
Statement
For every connected bipartite graph with vertices and every chosen vertex , let be uniformly distributed over the finite set . Define the range by . Then the conjecture asserts that
where is the path on vertices and is defined analogously, with any one vertex pinned at .
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.