BIROn - Birkbeck Institutional Research Online

    Nearly-linear monotone paths in edge-ordered graphs

    Bucic, M. and Kwan, M. and Pokrovskiy, Alexey and Sudakov, B. and Tran, T. and Wagner, A.Z. (2019) Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics , ISSN 0021-2172. (In Press)

    [img] Text
    1809.01468.pdf - Author's Accepted Manuscript
    Restricted to Repository staff only

    Download (232kB) | Request a copy

    Abstract

    How long a monotone path can one always find in any edge-ordering of the complete graph Kn? This appealing question was first asked by Chvátal and Komlós in 1971, and has since attracted the attention of many researchers, inspiring a variety of related problems. The prevailing conjecture is that one can always find a monotone path of linear length, but until now the best known lower bound was n^2/3−o(1). In this paper we almost close this gap, proving that any edge-ordering of the complete graph contains a monotone path of length n^1−o(1).

    Metadata

    Item Type: Article
    Additional Information: The final publication is available at Springer via the link above.
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Economics, Mathematics and Statistics
    Depositing User: Alexey Pokrovskiy
    Date Deposited: 20 Jan 2020 13:23
    Last Modified: 22 Jan 2020 05:21
    URI: http://eprints.bbk.ac.uk/id/eprint/30606

    Statistics

    Downloads
    Activity Overview
    1Download
    20Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item