The subdivision conjecture for K_4
Statement
Let be the complete graph on four vertices, and let a subdivision be a graph obtained by replacing edges by paths. A graph is SPN if it is the sum of a positive semidefinite matrix and a nonnegative matrix.
Subdivision conjecture for . Every subdivision of in which all six edges were subdivided, each at least once, is SPN.
The conjecture concerns the remaining subdivisions of in the proposed characterization of SPN graphs. The source states that the case in which each edge is subdivided once is unresolved and does not provide a resolution of the general conjecture.
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.