Existence of resolvable path designs (Q923105): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q216124 |
Changed an Item |
||
Property / author | |||
Property / author: Jean-Claude Bermond / rank | |||
Normal rank |
Revision as of 23:43, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Existence of resolvable path designs |
scientific article |
Statements
Existence of resolvable path designs (English)
0 references
1990
0 references
Let \(\lambda K_ n\) denote the complete multigraph on n vertices in which every edge has multiplicity \(\lambda\), and let \(P_ k\) denote the path with k vertices. A \(P_ k\)-factor of \(\lambda K_ n\) is a spanning subgraph each component of which is isomorphic to \(P_ k\). The authors prove that the edge set of \(\lambda K_ n\) has a partition into \(P_ k\)-factors, \(k\geq 2\), if and only if \(n\equiv 0(mod k)\) and \(\lambda\) k(n-1)\(\equiv 0(mod 2k-2)\).
0 references
factorization
0 references
resolvable
0 references
complete multigraph
0 references
\(P_ k\)-factor
0 references
spanning subgraph
0 references
partition
0 references