The Graph Complement Conjecture for the Colin de Verdière parameter
Let be a graph, let be its complement, and let be the maximum nullity among positive semidefinite matrices in satisfying the Strong Arnold property. Let denote the number of vertices of .
Graph Complement Conjecture for . For any graph ,
The inequality is stronger than the corresponding minimum-rank conjectures because . The source gives no general resolution here, although later results in the paper establish conditional bounds.
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.