Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs (Q558238): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00493-004-0021-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063292662 / rank | |||
Normal rank |
Latest revision as of 19:06, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs |
scientific article |
Statements
Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs (English)
0 references
5 July 2005
0 references
The Kelly conjecture states that every regular tournament on \(2k+1\) vertices has a decomposition into \(k\) arc-disjoint Hamiltonian cycles. The authors formulate a generalization of this conjecture, i.e., every \(k\)-arc-strong tournament contains \(k\) arc-disjoint spanning strong subdigraphs. Several results supporting this conjecture are proved.
0 references
Hamiltonian cycles
0 references
decomposition
0 references
Kelly conjecture
0 references