On complementary decompositions of the complete graph

DOI10.1007/BF01788658zbMath0674.05050MaRDI QIDQ1121285

Andrew Granville, Alexandros Moisiadis, R. S. Rees

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

BIBDbalanced incomplete block designsgraph decompositions

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

On combinatorial designs with subdesigns ⋮ The spectrum for 2-perfect 6-cycle systems ⋮ Decompositions of edge-colored complete graphs ⋮ Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 ⋮ Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures ⋮ Minimum embedding of a \(P_{4}\)-design into a balanced incomplete block design of index \(\lambda \) ⋮ Constructions and uses of incomplete pairwise balanced designs

Cites Work

• Unnamed Item
• Steiner pentagon systems
• The spectrum of nested Steiner triple systems
• A construction for authentication/secrecy codes from certain combinatorial designs
• Optimal packings of \(K_4\)'s into a \(K_n\)
• The Existence and Construction of Balanced Incomplete Block Designs

This page was built for publication: On complementary decompositions of the complete graph