General expectation conjecture for mandatory and blocking edges
General expectation conjecture for mandatory and blocking edges
Under the setting and notation of Theorem~, let be the set of maximum-size matchings in . Let be the probability law appearing in that setting, and let be the corresponding threshold parameter. For two independent samples from , write .
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
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 and 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
Sign in to submit a solution.
No solutions have been posted yet.