Edge partitions of the complete symmetric directed graph and related designs

DOI10.1007/BF02761904zbMath0472.05027OpenAlexW1987000845MaRDI QIDQ1158162

Katherine Heinrich, Moshe Rosenfeld, Brian Alspach

Publication date: 1981

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02761904

zbMATH Keywords

directed cyclescomplete symmetric directed graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

On polynomials of small degree over finite fields representing quadratic residues ⋮ Construction of Hamilton path tournament designs ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ A class of self-orthogonal 2-sequencings ⋮ Self-orthogonal Hamilton path decompositions ⋮ Polynomials and primitive elements in Galois rings ⋮ On defining sets of full designs ⋮ Polynomials of degree 4 over finite fields representing quadratic residues ⋮ The construction of Kotzig factorizations ⋮ Brian Alspach and his work

Cites Work

• Decomposition of the complete directed graph into k-circuits
• Polynomials that represent quadratic residues at primitive roots
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Decompositions of Complete Graphs Defined by Quasigroups
• $F$-Square and Orthogonal $F$-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item