For n ≥ 15, we prove that the minimum number of triangles in an n-vertex K 4saturated graph with minimum degree 4 is exactly 2n − 4, and that there is a unique extremal graph. This is a triangle version of a result of Alon, Erdős, Holzman, and Krivelevich from 1996. Additionally, we show that for any s > r ≥ 3 and t ≥ 2(s−2)+1, there is a K s-saturated n-vertex graph with minimum degree t that has s−2 r−1 2 r−1 n + c s,r,t copies of K r. This shows that unlike the number of edges, the number of K r 's (r > 2) in a K s-saturated graph is not forced to grow with the minimum degree, except for possibly in lower order terms.