Maximum packings of \(K_ n\) with copies of \(K_ 4-e\) (Q1916965)

A \(K_4- e\) design of order \(n\) is a pair \((S, B)\), where \(B\) is an edge disjoint decomposition of the edge set of the complete graph \(K_n\) on \(S\), \(|S|= n\), into copies of \(K_4\) with an edge deleted. When \(B\) is just a collection of copies of \(K_4- e\) such that \(|B|\) is as large as possible, a maximum packing of \(K_n\) of order \(n\) with copies of \(K_4- e\) (MPK) is obtained. The collection of unused edges is the leave of the \(\text{MPK}\) \((S, B)\). The authors determine, for each \(n\), the maximum number of pairwise disjoint copies of \(K_4- e\) in \(K_n\) and all possible leaves. The leave is empty, i.e. the MPK is a \(K_4- e\) design, for \(n\equiv 0, 1, 5\) or \(6\pmod{10}\), \(n\geq 6\). For the remaining congruence classes \(\text{mod } 10\) the leave consists of one of the possible configurations of three edges if \(n\equiv 3\) or \(8\pmod{10}\), \(n\geq 13\), and of just one edge in the other cases. Exceptional configurations occur for \(n= 5, 7\) and 8 and all are examined. The small cases are dealt with by explicit constructions, and a general construction, which uses commutative quasigroups with holes, takes care of all cases \(n\geq 32\).