ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph containing K2,3K_{2,3} as a minor, and let the 33-subdivision of GG be the graph obtained by subdividing every edge of GG three times. Equip it with its shortest path metric.

Negative type conjecture. There is no graph GG with a K2,3K_{2,3} minor where the shortest distance metric of the 33-subdivision of GG has negative type.

This conjecture proposes that the obstruction to negative type established for sufficiently fine subdivisions already occurs for the 33-subdivision. The preceding results give a bound of 180180 and show that the 22-subdivision of K4K_4 is even ℓ1\ell_1-embeddable, leaving the sharp threshold between these cases 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.