We survey algorithmic and asymptotic results related to the title. Particularly, for sparse classes we interpret the asymptotic value of these parameters as degree of freedom. This in turn characterizes the somewhere dense vs nowhere dense dichotomy of graph classes.