Prefer a chat interface with context about you and your work?
The saturation function of complete partite graphs
A graph G is called F -saturated if it is F -free but the addition of any missing edge to G creates a copy of F .Let the saturation function sat(n, F ) be the minimum number of edges that an F -saturated graph on n vertices can have.We determine …