Results and Open Problems on Minimum Saturated Hypergraphs.
Oleg Pikhurko · 2004
Let F be a family of k-graphs. A k-graph G is called F-saturated if it a maximal graph not containing any member of F as a subgraph. We investigate the smallest number of edges that an F-saturated graph on n vertices can have. We present new results and open problems for different instances of F.