Conjecture on residues of perfect-matching counts in random regular bipartite multigraphs
Statement
Fix an integer . For an even sufficiently large integer , let be a random -regular bipartite multigraph on vertices, and let the number of its perfect matchings be considered modulo . Perfect-matching residue conjecture. There is a real number such that, for every , the number of perfect matchings of is congruent to modulo with probability at least . This conjecture concerns the typical distribution modulo 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.