The strong -conjecture for the Colin de Verdière parameter
Let be a graph. Let be its minimum degree, let be its degeneracy,
let be the maximum of over minors of , and let be the positive semidefinite Colin de Verdière parameter.
Strong -conjecture for . For any graph ,
The first two inequalities follow directly from the definitions, while the conjectural content is the final inequality. The source later says that the corresponding original -conjecture is used conditionally and does not supply a resolution of this full chain in the candidate span.
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.