ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let α(G)\alpha(G) be its independence number, and let c(G)c(G) be the number of cut-vertices of GG. Graffiti's cut-vertex conjecture.

α(G)≥1+c(G)2\alpha(G) \geq 1+\frac{c(G)}{2}

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.