Weak balls conjecture for biregular bipartite multigraphs
Statement
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.
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.