Year: 2026
Type: preprint
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)$.
Source: arXiv (Cornell University)
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7224116250