AGX's order-to-degree lower bound for the independence number
Let be a graph, let be its independence number, let be the number of vertices of , and let be its maximum degree. AGX's order-to-degree conjecture.
The source attributes this bound to AGX conjecture-making software and verifies it for the graph classes considered there, but gives no general proof or disproof.
References
- Boris Brimkov and Valentin Brimkov, “Graphs with degree sequence \m^m-1,n^n-1\ and \m^n,n^m\”, arXiv:2308.06670 (2023).
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.