Mutually orthogonal cycle systems

DOI10.26493/1855-3974.2692.86DzbMATH Open1506.05038arXiv2203.00816OpenAlexW4283702884MaRDI QIDQ5871595FDOQ5871595

Authors: Nicholas J. Cavenagh, David A. Pike, Andrea Burgess 

Publication date: 23 January 2023

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Abstract: An $ell$-cycle system $mathcalF$ of a graph $Gamma$ is a set of $ell$-cycles which partition the edge set of $Gamma$. Two such cycle systems $mathcalF$ and $mathcalF\text{'}$ are said to be {em orthogonal} if no two distinct cycles from $mathcalFcup{m}^{\prime }athcalF$ share more than one edge. Orthogonal cycle systems naturally arise from face $2$-colourable polyehdra and in higher genus from Heffter arrays with certain orderings. A set of pairwise orthogonal $ell$-cycle systems of $Gamma$ is said to be a set of mutually orthogonal cycle systems of $Gamma$. Let $mu(ell,n)$ (respectively, $m{u}^{\prime }(ell,n)$) be the maximum integer $mu$ such that there exists a set of $mu$ mutually orthogonal (cyclic) $ell$-cycle systems of the complete graph $K_n$. We show that if $ellgeq4$ is even and $nequiv1pmod2ell$, then $m{u}^{\prime }(ell,n)$, and hence $mu(ell,n)$, is bounded below by a constant multiple of $n/el{l}^2$. In contrast, we obtain the following upper bounds: $mu(ell,n)leqn-2$; $mu(ell,n)leq(n-2)(n-3)/(2(ell-3))$ when $ellgeq4$; $mu(ell,n)leq1$ when $ell>n/sqrt2$; and $m{u}^{\prime }(ell,n)leqn-3$ when $ngeq4$. We also obtain computational results for small values of $n$ and $ell$.

Full work available at URL: https://arxiv.org/abs/2203.00816

Recommendations

• \(k\)-cyclic even cycle systems of the complete graph
• Orthogonally resolvable cycle decompositions
• scientific article; zbMATH DE number 2192108
• Even \((m_1,m_2,\dots ,m_r)\)-cycle systems of the complete graph.
• Cyclic even cycle systems of the complete graph

zbMATH Keywords

super-simpleHeffter arraysorthogonal cycle decompositionscompletely-reduciblecyclic cycle systems

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Cites Work

• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Cyclic Hamiltonian cycle systems of the complete graph.
• Title not available (Why is that?)
• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• Existence of cyclic \(k\)-cycle systems of the complete graph
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• On large sets of disjoint Steiner triple systems. IV
• Cyclic odd \(3K\)-cycle systems of the complete graph
• Cyclically decomposing the complete graph into cycles
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
• Biembeddings of symmetric \(n\)-cycle systems
• Cycle decompositions with a sharply vertex transitive automorphism group
• Skolem-type difference sets for cycle systems
• Doubly even orientable closed 2-cell embeddings of the complete graph
• Design and topology
• Biembedding Steiner triple systems and \(n\)-cycle systems on orientable surfaces
• Heffter arrays and biembedding graphs on surfaces
• The existence of square integer Heffter arrays
• Square integer Heffter arrays with empty cells
• Title not available (Why is that?)
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Cyclic even cycle systems of the complete graph
• Orthogonal \(H\)-decompositions.
• A generalization of Heffter arrays
• Cyclic cycle systems of the complete multipartite graph

Cited In (4)

• A survey of Heffter arrays
• Heffter spaces
• Non-zero sum Heffter arrays and their applications
• Orthogonal cycle systems with cycle length less than 10

This page was built for publication: Mutually orthogonal cycle systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5871595)