For a hypergraph H, define its intersection spectrum I(H) as the set of all intersection sizes | E∩ F| of distinct edges E, F∈ E(H). In their seminal paper from 1973 which introduced the local lemma, Erdős and Lovász asked: how large must the intersection spectrum of a k-uniform 3-chromatic intersecting hypergraph be? They showed that such a hypergraph must have at least three intersection sizes, and conjectured that the size of the intersection spectrum tends to infinity with k. Despite the problem being reiterated several times over the years by Erdős and other researchers, the lower bound of three intersection sizes has remarkably withstood any improvement until now. In this paper, we prove the Erdős–Lovász conjecture in a strong form by showing that there are at least k1 / 2 - o ( 1 ) intersection sizes. In this extended abstract we sketch a simpler argument which gives slightly weaker bound of k1 / 3 - o ( 1 ). Our proof consists of a delicate interplay between Ramsey type arguments and a density increment approach.