The claim of (k+1+eps)/3 appears incorrect; the recursive procedure
of Berman-Furer works for IS in bounded-degree graphs, but doesn't seem
to work for k-claw free graphs (k-set packing).

5 December 2012 / Magnus M. Halldorsson