AGX's order-to-degree lower bound for the independence number
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.