Asymptotic results on suborthogonal \(\overrightarrow{\mathfrak G}\)-decompositions of complete digraphs

DOI10.1016/S0166-218X(99)00083-9zbMath0933.05123OpenAlexW2011718788MaRDI QIDQ1302165

Sven Hartmann

Publication date: 2 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00083-9

zbMATH Keywords

partitioncomplete digraph\(\overrightarrow{\mathfrak G}\)-decomposition

Mathematics Subject Classification ID

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

Related Items (8)

Super-simple balanced incomplete block designs with block size 5 and index 3 ⋮ Super-simple (\(v\),\,5,\,2)-designs. ⋮ Orthogonal double covers of general graphs. ⋮ Unnamed Item ⋮ Super-simple \((\nu, 5, 5)\) designs ⋮ Super-simple balanced incomplete block designs with block size 4 and index 9 ⋮ Super-simple balanced incomplete block designs with block size 4 and index 5 ⋮ Superpure digraph designs

This page was built for publication: Asymptotic results on suborthogonal \(\overrightarrow{\mathfrak G}\)-decompositions of complete digraphs