ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph GG is nearly bipartite if every subset S⊆V(G)S\subseteq V(G) has an independent set of size ⌊∣S∣/2⌋\lfloor |S|/2\rfloor.

Nearly bipartite deletion conjecture. A nearly bipartite graph can be made bipartite by deleting at most 55 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 K4K_4. 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 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.