The positive semidefinite Graph Complement Conjecture
Let be a graph, and let denote the minimum rank among positive semidefinite matrices in the class of real symmetric matrices described by . Write for the complement of and for its number of vertices.
Positive semidefinite Graph Complement Conjecture. For any graph ,
This strengthens the ordinary Graph Complement Conjecture, and the source notes that the bound is sharp for paths; no general resolution is supplied.
References
- Francesco Barioli, Shaun M. Fallat, Himanshu Gupta and Zhongshan Li, “The Weak Version of the Graph Complement Conjecture and Partial Results for the Delta Conjecture”, arXiv:2505.24577 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.