Increasing Hamiltonian paths in random edge orderings
From MaRDI portal
Publication:2811165
DOI10.1002/rsa.20592zbMath1338.05150OpenAlexW1709909086MaRDI QIDQ2811165
Publication date: 10 June 2016
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20592
Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (9)
Increasing paths in edge-ordered graphs: the hypercube and random graph ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Turán problems for edge-ordered graphs ⋮ Most edge‐orderings of Kn have maximal altitude ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ Phase transition for accessibility percolation on hypercubes ⋮ On edge‐ordered Ramsey numbers ⋮ Long Monotone Trails in Random Edge-Labellings of Random Graphs
Cites Work
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- A variational problem for random Young tableaux
- On the number of permutations on \(n\) objects with greatest cycle length \(k\)
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Increasing paths in edge ordered graphs
- A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- On the number of hamilton cycles in a random graph
- Almost all regular graphs are hamiltonian
- On the Number of Hamilton Cycles in Sparse Random Graphs
- Some Combinatorial Theorems on Monotonicity
- Note on Runs of Consecutive Elements
- On a theorem of Erdős and Szekeres
This page was built for publication: Increasing Hamiltonian paths in random edge orderings
