Corrigendum to "SPN graphs: when copositive = SPN"

Abstract

In this corrigendum, an error in the proof of a theorem in [Linear Algebra and its Applications 509 (2016) 82--113] is pointed out. This theorem states that every graph Tn consisting of n-2 triangles sharing a common base is SPN. An alternative proof is given here for the case n=5, but for all n>5 it remains open whether Tn is SPN. As a result, the question whether K2,n, n>4, is SPN also remains open.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…