A note on the decomposition of graphs into isomorphic matchings (Q790841)

A graph G is said to have an H-decomposition if it is the union of pairwise edge-disjoint subgraphs, each isomorphic to H. The graph \(tK_ 2\) is the graph consisting of t independent edges. For a graph G to have a \(tK_ 2\) decomposition it is clearly necessary that \(t| e(G)\) and \(\Delta(G)\leq e(G)| t.\) In this note the author shows that for graphs with more than (8/3) \(t^ 2-2t\) edges, these conditions are also sufficient.