Large sets and overlarge sets of triangle-decomposition (Q871677)

A triangle is a graph with three vertices and three edges or arcs such that for any two vertices there is exactly one (undirected) edge or one (directed) arc to join them. A triangle-decomposition is a partition of all edges of either a complete graph \(\lambda K_v\), a complete digraph \(\lambda DK_v\) or a complete mixed graph \(\lambda K_v \cup \lambda DK_v\) such that each element of the partition defines a triangle of the same type. In the paper under review, the authors discuss the spectrum of so-called large and overlarge sets of some triangle-decompositions.