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 条

[41] Two “Dual” Families of Nearly-Linear Codes over ℤp, p odd
Bram van Asch
Henk C. A. van Tilborg
Applicable Algebra in Engineering, Communication and Computing, 2001, 11 : 313 - 329
[42] Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time
Chekuri, Chandra
Quanrud, Kent
2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 789 - 800
[43] Distributed Fast Crash-Tolerant Consensus with Nearly-Linear Quantum Communication
HajiAghayi, Mohammad T.
Kowalski, Dariusz R.
Olkowski, Jan
Leibniz International Proceedings in Informatics, LIPIcs, 297
[44] A LINEAR-TIME ALGORITHM FOR EDGE-DISJOINT PATHS IN PLANAR GRAPHS
WAGNER, D
WEIHE, K
COMBINATORICA, 1995, 15 (01) : 135 - 150
[45] Enumerative problems for arborescences and monotone paths on polytope graphs
Athanasiadis, Christos A.
De Loera, Jesus A.
Zhang, Zhenyang
JOURNAL OF GRAPH THEORY, 2022, 99 (01) : 58 - 81
[46] Two "Dual" families of nearly-linear codes over Ζp,p odd
van Asch, B
van Tilborg, HCA
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 11 (04) : 313 - 329
[47] Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
Hoske, Daniel
Lukarski, Dimitar
Meyerhenke, Henning
Wegner, Michael
EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 205 - 218
[48] THE EDGE INTERSECTION GRAPHS OF PATHS IN A TREE
GOLUMBIC, MC
JAMISON, RE
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (01) : 8 - 22
[49] PATHS AND EDGE-CONNECTIVITY IN GRAPHS
OKAMURA, H
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1984, 37 (02) : 151 - 172
[50] Forbidden paths and cycles in ordered graphs and matrices
Pach, Janos
Tardos, Gabor
ISRAEL JOURNAL OF MATHEMATICS, 2006, 155 (1) : 359 - 380

← 1 2 3 4 5 →