Graffiti's radius lower bound for the independence number
Statement
Let be a graph, let be its independence number, and let be its graph radius. Graffiti's radius conjecture.
The source verifies the intended bound for the listed graph classes from , but does not state that Graffiti's conjecture is solved in general.
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.