On the distinct maximal-clique sizes in $k$-uniform hypergraphs

Jiabao Yang, Lixiang Yu, Leilei Zhang

Let $g(n,k)$ be the maximum number of distinct sizes of maximal cliques in an $n$-vertex $k$-uniform hypergraph, and let $f(n,k)=n-g(n,k)$. We determine the asymptotic order of $f(…