A large minimum degree eliminates the possibility of having some 'pathological' vertices; if the minimum degree of a graph "G" is 1, for example, then there can be no isolated vertices (even though "G" may have very few edges).