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 条

[31] A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks
Zhu, Liwang
Zhang, Zhongzhi
PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 2648 - 2656
[32] Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Gishboliner, Lior
Jin, Zhihan
Sudakov, Benny
COMBINATORICA, 2024, 44 (03) : 509 - 529
[33] Large monotone paths in graphs with bounded degree
Yuster, R
GRAPHS AND COMBINATORICS, 2001, 17 (03) : 579 - 587
[34] Ramsey Problems for Monotone Paths in Graphs and Hypergraphs
Lior Gishboliner
Zhihan Jin
Benny Sudakov
Combinatorica, 2024, 44 : 509 - 529
[35] Large Monotone Paths in Graphs with Bounded Degree
Raphael Yuster
Graphs and Combinatorics, 2001, 17 : 579 - 587
[36] A Simple, Combinatorial Algorithm for Solving SDD Systems in Nearly-Linear Time
Kelner, Jonathan A.
Orecchia, Lorenzo
Sidford, Aaron
Zhu, Zeyuan Allen
STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 911 - 920
[37] Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA
Diakonikolas, Ilias
Kane, Daniel M.
Pensia, Ankit
Pittas, Thanasis
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 202, 2023, 202
[38] Nearly-Linear Time Positive LP Solver with Faster Convergence Rate
Allen-Zhu, Zeyuan
Orecchia, Lorenzo
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 229 - 236
[39] Edge coloring nearly bipartite graphs
Reed, B
OPERATIONS RESEARCH LETTERS, 1999, 24 (1-2) : 11 - 14
[40] Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions
Ding, Ming
Kyng, Rasmus
Zhang, Peng
arXiv, 2022,

← 1 2 3 4 5 →