The weak K-two-threes conjecture for metric matrices
Statement
Let be an -by- metric matrix, meaning a hollow, symmetric, nonnegative matrix satisfying for all . Equivalently, for some weighted graph and edge-weight function . The weak K-two-threes conjecture. The matrix has at most
positive eigenvalues. The conjecture is motivated by the preceding characterization of -minor-free graphs and is stated to be tight; its resolution is not provided here.
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.