Negative type conjecture for 3-subdivisions of graphs with a K_2,3 minor
Statement
Let be a graph containing as a minor, and let the -subdivision of be the graph obtained by subdividing every edge of three times. Equip it with its shortest path metric.
Negative type conjecture. There is no graph with a minor where the shortest distance metric of the -subdivision of has negative type.
This conjecture proposes that the obstruction to negative type established for sufficiently fine subdivisions already occurs for the -subdivision. The preceding results give a bound of and show that the -subdivision of is even -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.