Existence of resolvable path designs (Q923105): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0195-6698(13)80120-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045675394 / rank | |||
Normal rank |
Latest revision as of 09:46, 30 July 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