{"volume":238,"date_updated":"2023-02-23T14:01:35Z","type":"journal_article","extern":"1","publication_identifier":{"eissn":["1565-8511"],"issn":["0021-2172"]},"doi":"10.1007/s11856-020-2035-7","author":[{"first_name":"Matija","full_name":"Bucić, Matija","last_name":"Bucić"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","orcid":"0000-0002-4003-7567","first_name":"Matthew Alan","full_name":"Kwan, Matthew Alan"},{"full_name":"Pokrovskiy, Alexey","first_name":"Alexey","last_name":"Pokrovskiy"},{"full_name":"Sudakov, Benny","first_name":"Benny","last_name":"Sudakov"},{"last_name":"Tran","first_name":"Tuan","full_name":"Tran, Tuan"},{"first_name":"Adam Zsolt","full_name":"Wagner, Adam Zsolt","last_name":"Wagner"}],"_id":"9578","publication":"Israel Journal of Mathematics","publication_status":"published","abstract":[{"lang":"eng","text":"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 n2/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 n1-o(1)."}],"article_processing_charge":"No","citation":{"ieee":"M. Bucić, M. A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, “Nearly-linear monotone paths in edge-ordered graphs,” <i>Israel Journal of Mathematics</i>, vol. 238, no. 2. Springer, pp. 663–685, 2020.","short":"M. Bucić, M.A. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, A.Z. Wagner, Israel Journal of Mathematics 238 (2020) 663–685.","ama":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. Nearly-linear monotone paths in edge-ordered graphs. <i>Israel Journal of Mathematics</i>. 2020;238(2):663-685. doi:<a href=\"https://doi.org/10.1007/s11856-020-2035-7\">10.1007/s11856-020-2035-7</a>","mla":"Bucić, Matija, et al. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” <i>Israel Journal of Mathematics</i>, vol. 238, no. 2, Springer, 2020, pp. 663–85, doi:<a href=\"https://doi.org/10.1007/s11856-020-2035-7\">10.1007/s11856-020-2035-7</a>.","apa":"Bucić, M., Kwan, M. A., Pokrovskiy, A., Sudakov, B., Tran, T., &#38; Wagner, A. Z. (2020). Nearly-linear monotone paths in edge-ordered graphs. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-020-2035-7\">https://doi.org/10.1007/s11856-020-2035-7</a>","ista":"Bucić M, Kwan MA, Pokrovskiy A, Sudakov B, Tran T, Wagner AZ. 2020. Nearly-linear monotone paths in edge-ordered graphs. Israel Journal of Mathematics. 238(2), 663–685.","chicago":"Bucić, Matija, Matthew Alan Kwan, Alexey Pokrovskiy, Benny Sudakov, Tuan Tran, and Adam Zsolt Wagner. “Nearly-Linear Monotone Paths in Edge-Ordered Graphs.” <i>Israel Journal of Mathematics</i>. Springer, 2020. <a href=\"https://doi.org/10.1007/s11856-020-2035-7\">https://doi.org/10.1007/s11856-020-2035-7</a>."},"date_created":"2021-06-21T13:24:35Z","month":"07","page":"663-685","status":"public","external_id":{"arxiv":["1809.01468"]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"intvolume":"       238","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1809.01468"}],"title":"Nearly-linear monotone paths in edge-ordered graphs","scopus_import":"1","quality_controlled":"1","issue":"2","oa_version":"Preprint","year":"2020","publisher":"Springer","article_type":"original","day":"01","date_published":"2020-07-01T00:00:00Z"}