1 problem

Let $G$ be a graph and let $t$ be a positive integer. Write $G\cup tP_3$ for the disjoint union of $G$ and $t$ copies of $P_3$, and let $\tau(G)$ be the maximum integer such that…