Partitions of triples into optimal packings (Q1185904): Difference between revisions

For \(n\equiv 1, 3\pmod 6\), \(n>7\), it is possible to partition all triples of order \(n\) into \((n-2)\) pairwise disjoint optimal packings and for \(n\equiv 0, 2\pmod 6\), \(n>7\), to partition all triples of order \(n\) into \((n-1)\) pairwise disjoint optimal packings. The author has proved that for \(n\equiv 4\pmod 6\) it is possible to partition all triples of order \(n\) into \((n-1)\) pairwise disjoint optimal packings and one packing of size \((n-1)/3\). For \(n\equiv 5\pmod 6\) it is proved that it is possible to partition all triples of order \(n\) into \((n-2)\) pairwise disjoint optimal packings of order \(n\), the remaining triples are partitioned into two packings of sizes at least \((n-2)\) and at most \((n-2)/3\) respectively. Also given are recursive and nonrecursive constructions of partitions of triples of order \(n\equiv 5\pmod 6\) with \((n-1)\) pairwise disjoint packings of recursive constructions for optimal partitions for triples of order \(n\equiv 5\pmod 6\).