On the sizes of vertex-$k$-maximal $r$-uniform hypergraphs

Yingzhi Tian, Hong-Jian Lai, Jixiang Meng

Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$…