AbstractA graph G is (k1, k2, …, kt)‐saturated if there exists a coloring C of the edges of G in t colors 1, 2, …, t in such a way that there is no monochromatic complete ki‐subgraph K of color i, 1 ⩽ i ⩽ t, but the addition of any new edge of color i, joining two nonadjacent vertices in G, with C, creates a monochromatic K of color i, 1 ⩽ i ⩽ t. We determine the maximum and minimum number of edges in such graphs and characterize the unique extremal graphs.