Open problems on cyclic cycle decompositions of nearly complete 3-uniform hypergraphs
Let be the complete -uniform hypergraph on vertex set , and let consist of the missing triplets whenever . A decomposition is cyclic if translation is an automorphism. A decomposition is 2-split if it has the 2-split structure described earlier in the paper. The authors pose the following four problems. Cyclic decomposition problems. (i) For every with , there exists a cyclic -cycle decomposition of
(ii) For every with , there exists a cyclic 2-split -cycle decomposition of . (iii) For every with , there exists a cyclic -cycle decomposition of . (iv) For every with , there exists a cyclic 2-split -cycle decomposition of . These problems concern imposing cyclic symmetry, and remain open although the unrestricted decomposition spectrum has been completely determined.
References
Primary source
Anita Keszler and Zsolt Tuza, “Spectrum of 3-uniform 6- and 9-cycle systems over K_v^(3)-I”, arXiv:2212.11058 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.