Minimum K2, 3-Saturated Graphs

Authors


Abstract

A graph is K2, 3-saturated if it has no subgraph isomorphic to K2, 3, but does contain a K2, 3 after the addition of any new edge. We prove that the minimum number of edges in a K2, 3-saturated graph on math formula vertices is satmath formula.

Ancillary