The Graph Complement Conjecture for minimum rank
Let be a graph. Write for its complement, for the minimum rank of a real symmetric matrix described by , and for the number of vertices of .
Graph Complement Conjecture. For any graph ,
This is a classical Nordhaus–Gaddum-type conjecture in minimum rank theory; the bound is sharp for paths, but the source gives no resolution in general.
References
3 papers in this index state this conjecture (2013–2025). The statement above is taken from the most recent of them; the others are arXiv:2207.07294, arXiv:1304.3751.
Source: 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
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.