We prove that for every graph H with the minimum degree , the third iterated line graph of H contains as a minor. Using this fact we prove that if G is a connected graph distinct from a path, then there is a number such that for every the i-iterated line graph of G is -linked. Since the degree of is even, the result is best possible.