Shouldn't the reduction is input space for the subsequent hash functions actually make it easier to find collisions ? Or is finding collisions not closely relat

Shouldn't the reduction is input space for the subsequent hash functions actually make it easier to find collisions ? Or is finding collisions not closely related to input space ? The paper is a bit above my level of understanding and I tried making sense of how the cryptanalysis is done to no avail.