On the size of maximal intersecting families

Abstract

We show that an $n$ -uniform maximal intersecting family has size at most $e^{-n^{0.5+o(1)}}n^n$ . This improves a recent bound by Frankl ((2019) Comb. Probab. Comput.28(5) 733–739.). The Spread Lemma of Alweiss et al. ((2020) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing.) plays an important role in the proof.