Let $k\ge 0$. Let $G$ be a graph such that every subgraph $H$ contains an independent set of size $\ge (n-k)/2$, where $n$ is the number of vertices of $H$. Must $G$ be the union of a bipartite graph and $O_k(1)$ many vertices?