Answers are grounded in this paper and cite their sources.
We show that for each fixed n 3 it is NP-complete to determine whether an arbitrary graph can be edge-partitioned into subgraphs isomorphic to the complete graph Kₙ. The NP-completeness of a number of other edge-partition problems follows immediately.
No takes yet. Share an insight, caveat, or question.
Ian Holyer (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: