Minimum tP3-saturation graphs

A graph G is H-saturated if G does not contain H as a subgraph, but the addition of any edge between two nonadjacent vertices in G results in a copy of H in G. The saturation number sat(n,H) is the minimum number of edges in a n-vertex H-saturated. For a path P3 of order 3, let tP3 denote the disjoint union of t copies of P3. In Chen et al. (2015), Chen, Faudree, Faudree, Gould, Jacobson and Magnant obtain that n2≤sat(n,tP3)≤n2+3(t−1)