Nearly-linear monotone paths in edge-ordered graphs

被引：7

作者：

Bucic, Matija ^{[1
]}

Kwan, Matthew ^{[2
]}

Pokrovskiy, Alexey ^{[3
]}

Sudakov, Benny ^{[1
]}

Tran, Tuan ^{[4
]}

Wagner, Adam Zsolt ^{[1
]}

机构：

[1] Swiss Fed Inst Technol, Dept Math, CH-8092 Zurich, Switzerland

[2] Stanford Univ, Dept Math, Stanford, CA 94305 USA

[3] Birkbeck Univ London, Dept Econ Math & Stat, London WC1E 7HX, England

[4] Hanoi Univ Sci & Technol, Sch Appl Math & Informat, Hanoi, Vietnam

来源：

ISRAEL JOURNAL OF MATHEMATICS | 2020年 / 238卷 / 02期

关键词：

EXTREMAL COMBINATORICS; REGULAR SUBGRAPHS; ALTITUDE;

D O I：

10.1007/s11856-020-2035-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

How long a monotone path can one always find in any edge-ordering of the complete graphK(n)? This appealing question was first asked by Chvatal and Komlos 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 wasn(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 lengthn(1-o(1)).

引用

页码：663 / 685

页数：23

共 50 条

[21] BILEVEL FEATURE SELECTION IN NEARLY-LINEAR TIME
Hegde, Chinmay
2016 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2016,
[22] Dilation properties of coherent Nearly-Linear models
Pelessoni, Renato
Vicig, Paolo
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2022, 140 : 211 - 231
[23] Better Approximations for Tree Sparsity in Nearly-Linear Time
Backurs, Arturs
Indyk, Piotr
Schmidt, Ludwig
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2215 - 2229
[24] Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time
Dhulipala, Laxman
Eisenstat, David
Lacki, Jakub
Mirrokni, Vahab
Shi, Jessica
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
[25] Group isomorphism is nearly-linear time for most orders
Dietrich, Heiko
Wilson, James B.
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 457 - 467
[26] Sorting Signed Permutations by Reversals in Nearly-Linear Time
Dudek, Bartiomiej
Gawrychowski, Pawel
Starikovskaya, Tatiana
2024 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2024, : 199 - 214
[27] A Nearly-Linear Time Framework for Graph-Structured Sparsity
Hegde, Chinmay
Indyk, Piotr
Schmidt, Ludwig
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 928 - 937
[28] Semi-Random Sparse Recovery in Nearly-Linear Time
Kelner, Jonathan A.
Li, Jerry
Liu, Allen
Sidford, Aaron
Tian, Kevin
THIRTY SIXTH ANNUAL CONFERENCE ON LEARNING THEORY, VOL 195, 2023, 195
[29] A NOTE ON MONOTONE PATHS IN LABELED GRAPHS
REITERMAN, J
COMBINATORICA, 1989, 9 (02) : 231 - 232
[30] Sample-Optimal Density Estimation in Nearly-Linear Time
Acharya, Jayadev
Diakonikolas, Ilias
Li, Jerry
Schmidt, Ludwig
PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1278 - 1289

← 1 2 3 4 5 →