  We consider $k$-graphs on $n$ vertices, that is, $\mathcal{F}\subset
\binom{[n]}{k}$. A $k$-graph $\mathcal{F}$ is called intersecting if $F\cap
F'\neq \emptyset$ for all $F,F'\in \mathcal{F}$. In the present paper we prove
that for $k\geq 7$, $n\geq 2k$, any intersecting $k$-graph $\mathcal{F}$ with
covering number at least three, satisfies $|\mathcal{F}|\leq
\binom{n-1}{k-1}-\binom{n-k}{k-1}-\binom{n-k-1}{k-1}+\binom{n-2k}{k-1}+\binom{n-k-2}{k-3}+3$,
the best possible upper bound which was proved in \cite{F80} subject to
exponential constraints $n>n_0(k)$.
