The nearly bipartite deletion conjecture
Statement
A graph is nearly bipartite if every subset has an independent set of size .
Nearly bipartite deletion conjecture. A nearly bipartite graph can be made bipartite by deleting at most vertices.
The source presents this as a structural consequence of the characterization of nearly bipartite graphs by forbidden vertex-disjoint odd cycles and odd subdivisions of . No resolution of the five-vertex bound is supplied.
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.