English

Corrigendum to "SPN graphs: when copositive $=$ SPN"

Optimization and Control 2017-12-15 v1

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 TnT_n consisting of n2n-2 triangles sharing a common base is SPN. An alternative proof is given here for the case n=5n=5, but for all n>5n>5 it remains open whether TnT_n is SPN. As a result, the question whether K2,nK_{2,n}, n>4n>4, is SPN also remains open.

Cite

@article{arxiv.1712.05115,
  title  = {Corrigendum to "SPN graphs: when copositive $=$ SPN"},
  author = {Naomi Shaked-Monderer},
  journal= {arXiv preprint arXiv:1712.05115},
  year   = {2017}
}

Comments

4 pages. Corrigendum to arXiv:1604.02172

R2 v1 2026-06-22T23:17:45.971Z