Claims

../

1985_06_01_rodl_tuza: The fewest edge deletions making some n-vertex k-critical graph bipartite equal the binomial coefficient (k-1 choose 2) for all large n, so the conjectured growth of f_k fails.

---