We give a bound on the spectral radius of a graph implying a quantitative version of the Erdos-Stone theorem.