Hypergraph saturation irregularities
? - ? (13)
Electronic Journal of Combinatorics
MetadataShow full item record
Let F be a family of r-graphs. An r-graph G is called F-saturated if it does not contain any members of F but adding any edge creates a copy of some r-graph in F. The saturation number sat(F, n) is the minimum number of edges in an F-saturated graph on n vertices. We prove that there exists a finite family F such that sat(F, n)/n r-1 does not tend to a limit. This settles a question of Pikhurko.
- Mathematics