Hypergraph saturation irregularities

From MaRDI portal




Abstract: Let mathcalF be a family of r-graphs. An r-graph G is called mathcalF-saturated if it does not contain any members of mathcalF but adding any edge creates a copy of some r-graph in mathcalF. The saturation number operatornamesat(mathcalF,n) is the minimum number of edges in an mathcalF-saturated graph on n vertices. We prove that there exists a finite family mathcalF such that operatornamesat(mathcalF,n)/nr1 does not tend to a limit. This settles a question of Pikhurko.









This page was built for publication: Hypergraph saturation irregularities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753084)