Decompositions of edge-colored complete graphs

DOI10.1006/jcta.1999.3005zbMath0937.05064OpenAlexW2051968426MaRDI QIDQ1971615

Richard M. Wilson, Esther R. Lamken

Publication date: 4 June 2000

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

Full work available at URL: https://semanticscholar.org/paper/af50aea950acf008b6a91e53b78c3f97241527ac

zbMATH Keywords

decompositionautomorphism groupgroup divisible designgrid designresolvable designasymptotic existence theoremnear resolvable designedge-\(r\)-colored directed graphRoom \(d\)-cube

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (35)

Improving the existence bounds for grid-block difference families ⋮ A note on varieties of groupoids arising from \(m\)-cycle systems ⋮ Graph homomorphisms and nodal domains ⋮ 2-perfect directed \(m\)-cycle systems can be equationally defined for \(m=3,4\), and \(5\) only ⋮ \(2\)-perfect \(m\)-cycle systems can be equationally defined for \(m=3\), \(5\), and \(7\) only ⋮ Automorphism subgroups for designs with \(\lambda =1\) ⋮ Asymptotic existence theorems for frames and group divisible designs ⋮ The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs ⋮ Equiangular tight frames from group divisible designs ⋮ Grid-block difference families and related combinatorial structures ⋮ Nonlinear large deviations: beyond the hypercube ⋮ Graph divisible designs and packing constructions ⋮ Optimal Codes in the Enomoto-Katona Space ⋮ On balanced incomplete block designs with specified weak chromatic number ⋮ A connection between varieties of quasigroups and graph decompositions ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ A large order asymptotic existence theorem for group divisible 3-designs with index one ⋮ More on decompositions of edge-colored complete graphs ⋮ Fano kaleidoscopes and their generalizations ⋮ Asymptotic existence of frame-GBTDs ⋮ Directed complete bipartite graph decompositions: indirect constructions ⋮ Pairwise balanced designs with prescribed minimum dimension ⋮ Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs ⋮ The Asymptotic Existence of Resolvable Group Divisible Designs ⋮ The asymptotic existence of group divisible designs of large order with index one ⋮ The asymptotic existence of frames with a pair of orthogonal frame resolutions ⋮ Resolvable group divisible designs with large groups ⋮ A lower bound on HMOLS with equal sized holes ⋮ On perfect Γ-decompositions of the complete graph ⋮ An existence theory for loopy graph decompositions ⋮ Constructions and uses of incomplete pairwise balanced designs ⋮ Mutually orthogonal Latin squares with large holes ⋮ On cylindrical graph construction and its applications ⋮ Local balance in graph decompositions ⋮ Superpure digraph designs

Cites Work

• Steiner pentagon systems
• The spectrum of nested Steiner triple systems
• Edge-coloured designs with block size four
• On complementary decompositions of the complete graph
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• On colored designs. I
• On colored designs. II
• On reverse Steiner triple systems
• Cyclotomy and difference families in elementary Abelian groups
• The module structure of integral designs
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• The existence of reverse Steiner triple systems
• Existence results for near resolvable designs
• Self-orthogonal latin squares of all orders 𝑛≠2,3,6
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositions of edge-colored complete graphs