Balla, I. and Pokrovskiy, Alexey and Sudakov, B. (2017) A remark on Hamilton cycles with few colors. Moscow Journal of Combinatorics and Number Theory 7 (3), ISSN 2220-5438.
|
Text
1706.04903.pdf - Author's Accepted Manuscript Download (83kB) | Preview |
Official URL: http://mjcnt.phystech.edu/en/article.php?id=138
Abstract
Akbari, Etesami, Mahini, and Mahmoody conjectured that every proper edge colouring of Kn with n colours contains a Hamilton cycle with ≤O(logn) colours. They proved that there is always a Hamilton cycle with ≤8√n colours. In this note we improve this bound to O(log3n).
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Hamilton cycle, probabilistic methods, spectral techniques |
| School: | Birkbeck Faculties and Schools > Faculty of Business and Law > Birkbeck Business School |
| Depositing User: | Alexey Pokrovskiy |
| Date Deposited: | 21 Jan 2019 10:50 |
| Last Modified: | 02 Aug 2023 17:47 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/25890 |
Statistics
Downloads
Activity Overview
6 month trend
6 month trend
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
Edit/View Item