Optimal packing of even circuits into a \(\text{DK}_ v\)
type: Item
instance of: scholarly article
title: Optimal packing of even circuits into a \(\text{DK}_ v\)
zbMATH Open document ID: 0856.05076
DOI: 10.1016/0378-3758(95)00095-X
author: Yanyan Li
published in: Journal of Statistical Planning and Inference
publication date: 1997-02-17T00:00:00Z
review text: A packing of \(m\)-circuits into a complete directed symmetric graph with \(v\) vertices \((\text{DK}_v)\) is defined to be a family of edge disjoint directed cycles contained in \(\text{DK}_v\). The largest cardinality of such a packing will be denoted by \(p(v,m)\). The paper shows that for \(m =6, 8\) and 10, we have \(p(v,m) = B(v,m)\), where \(B(v,m) = \lceil v (v - 1)/m \rceil\) is an obvious upper bound for \(p(v,m)\). Hence, the values of \(p(v,m)\) are now known for all even \(m \leq 10\). Several results when \(m\) is even and greater than 10 are also presented.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 906670
zbMATH Keywords: circuits
zbMATH Keywords: decompositions
zbMATH Keywords: packing
reviewed by: Mirosław Truszczyński
MaRDI profile type: Publication
cites work: Packings and coverings of the complete directed multigraph with 3- and 4-circuits
cites work: An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
cites work: Decomposition of the complete directed graph into k-circuits
cites work: Q3872478
cites work: Q4198779
cites work: Q4026150
cites work: Q5619847
cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
Recommended article: Packing circuits into \(K_N\).
Recommended article: Packing circuits in eulerian digraphs
Recommended article: Packing odd circuits in Eulerian graphs
Recommended article: Optimal packings and coverings of \(\lambda\)DK\(_v\)
Recommended article: Packing directed circuits exactly
Recommended article: Packing Directed Circuits through Prescribed Vertices Bounded Fractionally
Recommended article: Optimal packings of edge-disjoint odd cycles
Recommended article: Packing circuits in matroids
Recommended article: Labeled packing of cycles and circuits
Recommended article: Q5075819
description: scientific article; zbMATH DE number 906670