A coupling conjecture for the symmetry rule in random bipartite graphs
Statement
Let be the binomial random bipartite graph, and let denote the graph obtained by deleting a component of maximum order. Let satisfy
and , and set . Define
The symmetry-rule coupling conjecture. The graphs , and can be coupled so that, with high probability,
This is an expected bipartite analogue of the symmetry rule for the binomial random graph, relating the graph remaining after deletion of its largest component in the weakly supercritical regime to nearby subcritical bipartite random graphs. The supplied text presents it as an expectation, so its resolution is not established here.
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.