Graph Cores via Universal Completability

Connelly Eisenberg-Nagy, 2014, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Journal of Combinatorial Theory, Series B, 108, 40, 10.1016/j.jctb.2014.02.011 Godsil, 2001, Algebraic Graph Theory, vol. 207 Laurent, 2014, Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property, Linear Algebra and its Applications, 452, 292, 10.1016/j.laa.2014.03.015 Laurent, 2014, A new graph parameter related to bounded rank positive semidefinite matrix completions, Mathematical Programming Series A, 145, 291, 10.1007/s10107-013-0648-x Nešetřil, 1971, Homomorphisms of derivative graphs, Discrete Mathematics, 1, 257, 10.1016/0012-365X(71)90014-8