Orthogonal cycle systems with cycle length less than 10

DOI10.1002/JCD.21921MaRDI QIDQ6187010zbMATH OpenOpenAlexFDO

Authors

Publication date 5 February 2024

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

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

zbMATH Keywords

Heffter arraysorthogonal cycle decompositions

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Paths and cycles (05C38)

Abstract: An $H$-decomposition of $G$ is a partition of the edge-set of $G$ into subsets, where each subset induces a copy of the graph $H$. A $k$-orthogonal $H$-decomposition of a graph $G$ is a set of $k$ $H$-decompositions of $G$, such that any two copies of $H$ in distinct $H$-decompositions intersect in at most one edge. When $G=K_v$ we call the $H$-decomposition an $H$-system of order $v$. In this paper we consider the case $H$ is an $l$-cycle and construct a pair of orthogonal $l$-cycle systems for all admissible orders when $l=5,6,7,8or9$, except $(l,v)=(7,7)$ and $(l,v)=(9,9)$.

Recommendations

• Orthogonal H-decompositions.
• Orthogonally resolvable cycle decompositions
• Mutually orthogonal cycle systems
• On the construction of odd cycle systems
• Orthogonal decomposition and packing of complete graphs

Cites work

• A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
• A new class of group divisible designs with block size three
• A problem on partial sums in abelian groups
• Biembedding Steiner triple systems and n-cycle systems on orientable surfaces
• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \)
• Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
• Heffter arrays and biembedding graphs on surfaces
• scientific article; zbMATH DE number 124514 (Why is no real title available?)
• Magic rectangles, signed magic arrays and integer -fold relative Heffter arrays
• Mutually orthogonal cycle systems
• Non-zero sum Heffter arrays and their applications
• On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
• On large sets of disjoint Steiner triple systems. IV
• On the existence of integer relative Heffter arrays
• Orthogonal H-decompositions.
• Orthogonal decomposition and packing of complete graphs
• Rectangular Heffter arrays: a reduction theorem
• Relative Heffter arrays and biembeddings
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Some recent developments on BIBDs and related designs
• Square integer Heffter arrays with empty cells
• The CRC handbook of combinatorial designs
• The existence of square integer Heffter arrays
• The existence of square non-integer Heffter arrays
• Tight Heffter arrays exist for all possible values

Cited in

(4)

• Heffter spaces
• Shiftable Heffter spaces
• More Heffter spaces via finite fields
• On relative simple Heffter spaces

This page was built for publication: Orthogonal cycle systems with cycle length less than 10

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