ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be a binary n×kn\times k matrix with non-negative integer entries, row sums kk, and column sums nn. Let M⊗MTM\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 M⊗MTM\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.

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.