  The Erd\H{o}s-Faber-Lov\'{a}sz conjecture (posed in 1972) states that the
chromatic index of any linear hypergraph on $n$ vertices is at most $n$. In
this paper, we prove this conjecture for every large $n$. We also provide
stability versions of this result, which confirm a prediction of Kahn.
