Maximum packing for perfect four-triple configurations (Q2470441): Difference between revisions

Maximum packings of \(3kK_n\), where \(k\) is a positive integer, \(K_n\) is the complete graph of \(n\) vertices, with 4-cycle-triples (the graph consisting of the four 3-cycles \((x_1,x_2,x_8)\), \((x_2,x_3,x_4)\), \((x_4,x_5,x_6)\) and \((x_6,x_7,x_8)\)) are considered. The complete solution of the problem for constructing perfect maximum packings is resolved in the case when \(n\) is the order of a \(3k\)-fold triple system.