MathDBThe forbidden-subgraph characterization conjecture for SPN graphs
The forbidden-subgraph characterization conjecture for SPN graphs
Let SPN denote the property of being the sum of a positive semidefinite matrix and a nonnegative matrix, and let the graphs in Theorem be the forbidden subgraphs listed there.
Forbidden-subgraph characterization conjecture. The list of graphs in Theorem is a complete list of forbidden subgraphs for the property of being SPN.
This conjecture would complete the characterization of SPN graphs by turning the necessary forbidden-subgraph list into a complete one. The source does not provide a resolution.
Sources & referencesView supporting material
Primary source
Naomi Shaked-Monderer, “SPN graphs: when copositive=SPN”, arXiv:1604.02172 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.