Extending the Gyárfás-Sumner conjecture

This in turn is a consequence of a bound on the maximum number of vertices in any graph that is minimal not k-split, a result first proved by Gyárfás [5] and for which we give a short proof.