Weak balls conjecture for biregular bipartite multigraphs
Weak balls conjecture for biregular bipartite multigraphs
Let be a binary matrix with non-negative integer entries, row sums , and column sums . Let be the matrix associated with the corresponding tensor-product adjacency structure. Weak balls conjecture. The -regular multigraph with vertices and adjacency matrix 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
Sign in to submit a solution.
No solutions have been posted yet.