ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix an integer q≥3q\ge 3. For an even sufficiently large integer nn, let GG be a random qq-regular bipartite multigraph on nn vertices, and let the number of its perfect matchings be considered modulo qq. Perfect-matching residue conjecture. There is a real number ε>0\varepsilon>0 such that, for every i∈{0,1,…,q−1}i\in\{0,1,\ldots,q-1\}, the number of perfect matchings of GG is congruent to ii modulo qq with probability at least ε\varepsilon. This conjecture concerns the typical distribution modulo qq of perfect-matching counts in random regular bipartite multigraphs; the supplied text gives no resolution, so its status remains open.

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.