Given a graph H, we say a graph G is H-saturated if G does not contain H as a subgraph and the addition of any edge e′ 6∈ E(G) results in H as a subgraph. In this paper, we construct (K4 − e)-saturated graphs with |E(G)| either the size of a complete bipartite graph, a 3-partite graph, or in the interval [ 2n− 4, ⌊ n 2 ⌋ ⌈ n 2 ⌉ − n+ 6 ] . We then extend the (K4−e)-saturated graphs to (Kt − e)-...
