On the minimum degree forcing F-free graphs to be (nearly) bipartite

Let image denote the minimum number of edges to be removed from a graph G to make it bipartite. For each 3-chromatic graph F we determine a parameter image such that for each F-free graph G on n vertices with minimum degree image we have image, while there are F-free graphs H with image for which image.