ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,n,p)G(n,n,p) be the binomial random bipartite graph, and let GL(n,n,p)G^L(n,n,p) denote the graph obtained by deleting a component LL of maximum order. Let ϵ=ϵ(n)>0\epsilon=\epsilon(n)>0 satisfy

ϵ3n→∞,\epsilon^3n\to\infty,

and ϵ=o(1)\epsilon=o(1), and set p=(1+ϵ)/np=(1+\epsilon)/n. Define

n±=(1−2ϵ±o(ϵ))n,p±=1−ϵ±o(ϵ)n±.n^{\pm}=(1-2\epsilon\pm o(\epsilon))n,\qquad p^{\pm}=\frac{1-\epsilon\pm o(\epsilon)}{n^{\pm}}.

The symmetry-rule coupling conjecture. The graphs GL(n,n,p)G^L(n,n,p), G(n−,n−,p−)G(n^-,n^-,p^-) and G(n+,n+,p+)G(n^+,n^+,p^+) can be coupled so that, with high probability,

G(n−,n−,p−)⊆GL(n,n,p)⊆G(n+,n+,p+).G(n^-,n^-,p^-)\subseteq G^L(n,n,p)\subseteq G(n^+,n^+,p^+).

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 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.