General expectation conjecture for mandatory and blocking edges

From papers

Under the setting and notation of Theorem~, let Mmax(Gn)\mathcal{M}_{\max}(G_n) be the set of maximum-size matchings in GnG_n. Let ζ\zeta' be the probability law appearing in that setting, and let kk be the corresponding threshold parameter. For two independent samples ((i,Z),(i,Z))((i,Z),(i',Z')) from ζ\zeta', write ((i,Z),(i,Z))ζζ((i,Z),(i',Z'))\sim\zeta'\otimes\zeta'.

General mandatory and blocking edge expectation conjecture. The expected proportions of edges belonging to every maximum-size matching and of edges belonging to no maximum-size matching satisfy

limnE[1E(Gn)eE(Gn)\mathbbm1MMmax(Gn), eM]=P((i,Z),(i,Z))ζζ(i+i<k),\lim_{n\to\infty}\mathbb{E}\left[\frac{1}{|E(G_n)|}\sum_{e\in E(G_n)}\mathbbm{1}_{\forall M\in\mathcal{M}_{\max}(G_n),\ e\in M}\right]=\mathbb{P}_{((i,Z),(i',Z'))\sim\zeta'\otimes\zeta'}(i+i'<k), limnE[1E(Gn)eE(Gn)\mathbbm1MMmax(Gn), eM]=P((i,Z),(i,Z))ζζ(i+i>k).\lim_{n\to\infty}\mathbb{E}\left[\frac{1}{|E(G_n)|}\sum_{e\in E(G_n)}\mathbbm{1}_{\forall M\in\mathcal{M}_{\max}(G_n),\ e\notin M}\right]=\mathbb{P}_{((i,Z),(i',Z'))\sim\zeta'\otimes\zeta'}(i+i'>k).

This is the companion to the Erdős–Rényi conjecture and proposes expectation-level limits for generic offspring distributions beyond the regimes covered by the proved results. The definitions of ζ\zeta' and kk are delegated to the referenced theorem, so their precise hypotheses should be checked.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Nathanaël Enriquez, Mike Liu, Laurent Ménard and Vianney Perchet, “Optimal matching under size priority”, arXiv:2601.20502 (2026).

Solutions 0

No solutions have been posted yet.