Saturation number of Berge stars in random hypergraphs (Q2215467)

Summary: Let \(G\) be a graph. We say an \(r\)-uniform hypergraph \(H\) is a Berge-\(G\) if there exists a bijection \(\phi: E(G)\to E(H)\) such that \(e\subseteq\phi(e)\) for each \(e\in E(G)\). Given a family of \(r\)-uniform hypergraphs \(\mathcal{F}\) and an \(r\)-uniform hypergraph \(H\), a spanning sub-hypergraph \(H'\) of \(H\) is \(\mathcal{F} \)-saturated in \(H\) if \(H^\prime\) is \(\mathcal{F}\)-free, but adding any edge in \(E(H)\backslash E(H^\prime)\) to \(H^\prime\) creates a copy of some \(F\in\mathcal{F}\). The saturation number of \(\mathcal{F}\) is the minimum number of edges in an \(\mathcal{F}\)-saturated spanning sub-hypergraph of \(H\). In this paper, we asymptotically determine the saturation number of Berge stars in random \(r\)-uniform hypergraphs.