The maximum size of intersecting $k$-graphs with covering number $k$

Source abstract

Let $m(k)$ be the maximum size of an intersecting $k$-graph with covering number $k$. In the present paper, it is proved that for all $k>e^{32}$, $$m(k)\ge k^k\exp\bigl(-50\sqrt{k\log k}\bigr).$$ Together with Zakharov's upper bound \cite{Z}, this implies $m(k)=k^k\exp\bigl(-k^{1/2+o(1)}\bigr)$.