Almost resolvable decomposition of K//n*

DOI10.1016/0095-8956(81)90067-8zbMath0509.05042OpenAlexW2053573731MaRDI QIDQ1838496

Frank E. Bennett, Dominique Sotteau

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90067-8

zbMATH Keywords

transitive tournamentdirected cycleresolvable decompositioncomplete symmetric directed graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

The existence of \(( \nu,6, \lambda\) )-perfect Mendelsohn designs with \(\lambda > 1\) ⋮ Large sets of resolvable Mendelsohn triple systems of prime power sizes ⋮ RESOLVABLE MENDELSOHN DESIGNS AND FINITE FROBENIUS GROUPS ⋮ Resolvable and near-resolvable decompositions of \(DK_ v\) into oriented 4-cycles ⋮ On minimum matrix representation of closure operations ⋮ Resolvable Mendelsohn designs with block size 4 ⋮ Almost resolvable perfect Mendelsohn designs with block size five ⋮ Some new Latin power sets not based on groups ⋮ Almost resolvable decompositions of \(2K_ n\) into cycles of odd length ⋮ Near 2-factorizations of \(2K_ n:\) Cycles of even length

Cites Work

• Unnamed Item
• Resolvable perfect cyclic designs
• On resolvable balanced incomplete block designs
• Balanced incomplete block designs and related designs
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Resolvable decomposition of \(K^*_n\)

This page was built for publication: Almost resolvable decomposition of K//n*