Minimum covering for hexagon triple systems (Q1877360)

The authors have recently obtained a complete solution to the problem of constructing perfect \(k\)-fold hexagon triple systems and perfect maximum packings of \(3k\)-fold \(K_n\) with hexagon systems [Discrete Math. 279, 325--335 (2004; Zbl 1043.05021)]. In the present paper the authors give a complete solution to the problem of constructing perfect minimum coverings of \(3k\)-fold \(K_n\) with hexagon triples.