ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MM be an nn-by-nn metric matrix, meaning a hollow, symmetric, nonnegative matrix satisfying mjk≤mij+mjkm_{jk}\leq m_{ij}+m_{jk} for all 1≤i,j,k≤n1\leq i,j,k\leq n. Equivalently, M=MϕGM=M_{\phi G} for some weighted graph GG and edge-weight function ϕ\phi. The weak K-two-threes conjecture. The matrix MM has at most

⌊n+13⌋\left\lfloor \frac{n+1}{3}\right\rfloor

positive eigenvalues. The conjecture is motivated by the preceding characterization of K2,3K_{2,3}-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 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.