BIROn - Birkbeck Institutional Research Online

    Edge disjoint Hamiltonian cycles in highly connected tournaments

    Pokrovskiy, Alexey (2019) Edge disjoint Hamiltonian cycles in highly connected tournaments. Technical Report. Birkbeck College, University of London, London, UK.

    [img]
    Preview
    Text
    Preprint_53_-_Pokrovskiy_-_Edge_Disjoint_Hamiltonian_Cycles_in_Highly_Connected_Tournaments.pdf

    Download (535kB) | Preview

    Abstract

    Thomassen conjectured that there is a function f(k) such that every strongly f(k)-connected tournament contains k edge-disjoint Hamiltonian cycles. This conjecture was recently proved by Kühn, Lapinskas, Osthus, and Patel who showed that f(k) ≤ O(k 2 (logk) 2 ) and conjectured that there is a constant C such that f(k) ≤ Ck 2 . We prove this conjecture. As a second application of our methods we answer a question of Thomassen about spanning linkages in highly connected tournaments.

    Metadata

    Item Type: Monograph (Technical Report)
    Additional Information: Birkbeck Pure Mathematics Preprint Series #53
    School: Birkbeck Faculties and Schools > Faculty of Business and Law > Birkbeck Business School
    Depositing User: Maura Paterson
    Date Deposited: 15 Jun 2020 11:06
    Last Modified: 02 Aug 2023 18:00
    URI: https://eprints.bbk.ac.uk/id/eprint/32254

    Statistics

    Activity Overview
    6 month trend
    156Downloads
    6 month trend
    177Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item