  A graph is K_{2,3}-saturated if it has no subgraph isomorphic to K_{2,3}, but
does contain a K_{2,3} after the addition of any new edge. We prove that the
minimum number of edges in a K_{2,3}-saturated graph on n >= 5 vertices is
sat(n, K_{2,3}) = 2n - 3.
