On tight 6-cycle decompositions of complete 3-uniform hypergraphs (Q2666573)

A decomposition of a hypergraph \(K\) is a set \(\Delta=\{H_1, H_2, \dots, H_s\}\) of subhypergraphs of \(K\) such that \(E(H_1)\cup E(H_2)\cup\cdots\cup E(H_s)=E(K)\) and \(E(H_i)\cap E(H_j)=\emptyset\) for all \(1\leq i<j\leq s\). If each element \(H_i\) of \(\Delta\) is isomorphic to a fixed hypergraph \(H\), then \(H_i\) is called an \(H\)-block, and \(\Delta\) is called an \(H\)-decomposition of \(K\). Let \(TC_m^{(k)}\) denote the \(k\)-uniform hypergraph with vertex set \(Z_m\) and (hyper)edge-set \(\{\{i,i+1,\dots,i+k-1\}:i\in Z_m\}\), where \(m>k\geq2\) and \(Z_m\) denotes the group of integers modulo \(m\). Any hypergraph isomorphic to \(TC_m^{(k)}\) is a \(k\)-uniform tight \(m\)-cycle. A complete 3-uniform hypergraph of order \(v\) admits a vertex set \(V\) of size \(v\) and the set of all 3-element subsets of \(V\) as its edge set. In this article, the authors settle the spectrum problem for the 3-uniform tight 6-cycle. More specifically, the authors show a characterization for a complete 3-uniform hypergraph of order \(v\) with a \(TC_6^{(3)}\)-decomposition, that is, a complete 3-uniform hypergraph of order \(v\) admits a \(TC_6^{(3)}\)-decomposition if and only if \(v\equiv1,2,10,20,28\), or \(29\pmod{36}\).