Long Monotone Trails in Random Edge-Labellings of Random Graphs. (8th January 2020)

• Record Type: Journal Article
• Authors: Angel, Omer; Ferber, Asaf; Sudakov, Benny; Tassion, Vincent
• Is Part Of: Combinatorics, probability and computing. Volume 29:Number 1(2020)
• Page Start: 22
• Page End: 30
• Publication Date: 2020-01-08
• Subjects: Primary 05C38, -- Secondary 05C80; Combinatorial analysis -- Periodicals; Probabilities -- Periodicals; Computer science -- Mathematics -- Periodicals; 511.6
• DOI: 10.1017/S096354831900018X
• Languages: English
• ISSNs: 0963-5483

Abstract

Abstract: Given a graph G and a bijection f : E ( G ) → {1, 2, …, e ( G )}, we say that a trail/path in G is f - increasing if the labels of consecutive edges of this trail/path form an increasing sequence. More than 40 years ago Chvátal and Komlós raised the question of providing worst-case estimates of the length of the longest increasing trail/path over all edge orderings of K n . The case of a trail was resolved by Graham and Kleitman, who proved that the answer is n -1, and the case of a path is still wide open. Recently Lavrov and Loh proposed studying the average-case version of this problem, in which the edge ordering is chosen uniformly at random. They conjectured (and Martinsson later proved) that such an ordering with high probability (w.h.p.) contains an increasing Hamilton path. In this paper we consider the random graph G = Gn, p with an edge ordering chosen uniformly at random. In this setting we determine w.h.p. the asymptotics of the number of edges in the longest increasing trail. In particular we prove an average-case version of the result of Graham and Kleitman, showing that the random edge ordering of Kn has w.h.p. an increasing trail of length (1- o (1)) en, and that this is tight. We also obtain an asymptotically tight result for the length of the longest increasing path for random Erdős-Renyi graphs with p = o (1).