Weak balls conjecture for biregular bipartite multigraphs

From papers

Let MM be a binary n×kn\times k matrix with non-negative integer entries, row sums kk, and column sums nn. Let MMTM\otimes M^T be the matrix associated with the corresponding tensor-product adjacency structure. Weak balls conjecture. The (non-bipartite)(non\text{-}bipartite) nknk-regular multigraph with nknk vertices and adjacency matrix MMTM\otimes M^T has a perfect matching. This conjecture is equivalent to Higgins's conjecture, and the paper proves special cases; the general case remains open.

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

Ilya I. Bogdanov, Fedor Petrov, Anton Sadovnichiy and Fedor Ushakov, “Biregular bipartite labeled multigraphs and perfect matchings in bipartite tensor products”, arXiv:2603.18253 (2026).

Solutions 0

No solutions have been posted yet.