Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors

DOI10.1016/j.laa.2016.07.026zbMath1348.52010MaRDI QIDQ314769

Ruriko Yoshida, Liam Solus, Caroline Uhler

Publication date: 16 September 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.07.026

zbMATH Keywords

cut polytope; series-parallel graph; elliptope; extremal matrix; graphs without \(K_5\) minors; sparsity order

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

52B20: Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry)

05C10: Planar graphs; geometric and topological aspects of graph theory

Uses Software

• polymake