A quick proof that \(K_{10}\neq{}P+P+P\) (Q1197019)

There are a number of proofs of the fact that the complete graph on 10 vertices, \(K_{10}\), cannot be factored into three copies of the Petersen Graph, \(P\). These are typically based on certain symmetries of the graph or properties of its eigenvalues. The following short proof of this novelty is based on the existence of strongly independent edges in \(P\) (such edges are mutually at distance at least two).