Journal article
Partitioning a tournament into sub-tournaments of high connectivity
- Abstract:
- We prove that there exists a constant c>0 such that the vertices of every strongly c·kt-connected tournament can be partitioned into t parts, each of which induces a strongly k-connected tournament. This is clearly tight up to a constant factor, and it confirms a conjecture of Kühn, Osthus and Townsend (2016).
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 515.6KB, Terms of use)
-
- Publisher copy:
- 10.1007/s00493-025-00161-3
Authors
- Publisher:
- Springer
- Journal:
- Combinatorica More from this journal
- Volume:
- 45
- Issue:
- 4
- Article number:
- 34
- Publication date:
- 2025-06-23
- Acceptance date:
- 2024-06-20
- DOI:
- EISSN:
-
1439-6912
- ISSN:
-
0209-9683
- Language:
-
English
- Pubs id:
-
2241302
- Local pid:
-
pubs:2241302
- Source identifiers:
-
3045702
- Deposit date:
-
2025-06-23
- ARK identifier:
This ORA record was generated from metadata provided by an external service. It has not been edited by the ORA Team.
Terms of use
- Copyright date:
- 2025
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record