Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\) (Q5934174): Difference between revisions

The author denotes the graph on five vertices consisting of a triangle with two degree-one vertices attached to the same vertex of the triangle as \(G_7\), and studies packings of this graph into a complete graph \(K_n\). He determines for each \(n\) the maximum number of copies of this graph that can be packed into \(K_n\). For the construction he uses pairs of orthogonal holey Latin squares. The case when this packing is actually a partition of the edge set (a graph design) has been solved previously by \textit{J.-C. Bermond} et al. [Ars Comb. 10, 211-254 (1980; Zbl 0454.05053)].