Graffiti's cut-vertex lower bound for the independence number
Statement
Let be a graph, let be its independence number, and let be the number of cut-vertices of . Graffiti's cut-vertex conjecture.
The paper verifies this inequality for the graph classes considered there using bounds on their cut-vertices and independence numbers, but the general conjecture remains open in the source.
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.