Most edge‐orderings of Kn have maximal altitude

DOI10.1002/rsa.20803zbMath1414.05268arXiv1605.07204OpenAlexW2962680010MaRDI QIDQ5381056

Anders Martinsson

Publication date: 7 June 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.07204

zbMATH Keywords

random graphsHamiltonian pathssize biasthird momentedge orderings

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Sharp Thresholds in Random Simple Temporal Graphs ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ On edge‐ordered Ramsey numbers ⋮ Long Monotone Trails in Random Edge-Labellings of Random Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Increasing paths in edge-ordered graphs: the hypercube and random graph
• Fundamentals of Stein's method
• Finding monotone paths in edge-ordered graphs
• Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
• Problems and results in extremal combinatorics. I.
• Method for constructing Stieltjes classes for \(M\)-indeterminate probability distributions
• Altitude of regular graphs with girth at least five
• Monotone paths in edge-ordered sparse graphs
• Caterpillar arboricity of planar graphs
• Increasing paths in edge ordered graphs
• Increasing Hamiltonian paths in random edge orderings
• Some Combinatorial Theorems on Monotonicity
• The Asymptotic Distribution of Runs of Consecutive Elements
• Note on Runs of Consecutive Elements

This page was built for publication: Most edge‐orderings of K_n have maximal altitude