Long Monotone Trails in Random Edge-Labellings of Random Graphs
From MaRDI portal
Publication:5222568
DOI10.1017/S096354831900018XzbMath1465.05156arXiv1808.07351OpenAlexW2979430184WikidataQ127127569 ScholiaQ127127569MaRDI QIDQ5222568
Asaf Ferber, Vincent Tassion, Omer Angel, Benjamin Sudakov
Publication date: 6 April 2020
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.07351
Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Sharp Thresholds in Random Simple Temporal Graphs ⋮ Nearly-linear monotone paths in edge-ordered graphs
Cites Work
- Unnamed Item
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- Monotone paths in edge-ordered sparse graphs
- Minimal positions in a branching random walk
- Nearly-linear monotone paths in edge-ordered graphs
- Monotone paths in dense edge-ordered graphs
- Increasing paths in edge ordered graphs
- Increasing Hamiltonian paths in random edge orderings
- A Combinatorial Lemma and Its Application to Probability Theory
- On the Variance of the Height of Random Binary Search Trees
- Most edge‐orderings of Kn have maximal altitude
- Some Combinatorial Theorems on Monotonicity
- Large monotone paths in graphs with bounded degree
This page was built for publication: Long Monotone Trails in Random Edge-Labellings of Random Graphs