Nesting of cycle systems of odd length

DOI10.1016/0012-365X(89)90360-9zbMath0714.05014WikidataQ127847464 ScholiaQ127847464MaRDI QIDQ750445

C. A. Rodger, Douglas R. Stinson, Charles C. Lindner

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spectrumnestingwheelsedge decompositionm-cycle systemnested cycle systems

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)

Related Items (13)

Linear spaces with many small lines ⋮ Small embeddings for partial cycle systems of odd length ⋮ Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles ⋮ On Decomposing the Complete Graph into the Union of Two Disjoint Cycles ⋮ Nesting House-designs ⋮ Sampling complete designs ⋮ Blocking sets in designs with block size four. II ⋮ The spectrum for 2-perfect 6-cycle systems ⋮ Nesting directed cycle systems of even length ⋮ The metamorphosis of lambda-fold block designs with block size four into lambda-fold triple systems ⋮ The spectrum of nested group divisible designs of typetⁿ ⋮ Neighbor designs and m-wheel systems ⋮ Almost resolvable decompositions of \(2K_ n\) into cycles of odd length

Cites Work

• The spectrum of nested Steiner triple systems
• Elliptic semiplanes and group divisible designs with orthogonal resolutions
• Nesting and almost resolvability of pentagon systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nesting of cycle systems of odd length