Claims

../

1999_02_01_reed: Reed proves that for every k there is f(k) such that a graph whose every subgraph H has an independent set of at least (|H|-k)/2 vertices becomes bipartite after deleting at most f(k) vertices, answering Problem 73.

---