Mutually orthogonal cycle systems

From MaRDI portal



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' are said to be {em orthogonal} if no two distinct cycles from mathcalFcupm′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, mu′(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 Kn. We show that if ellgeq4 is even and nequiv1pmod2ell, then mu′(ell,n), and hence mu(ell,n), is bounded below by a constant multiple of n/ell2. 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 mu′(ell,n)leqn−3 when ngeq4. We also obtain computational results for small values of n and ell.




Cites work









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)