Monotone paths in dense edge-ordered graphs
From MaRDI portal
Publication:2404821
DOI10.4310/JOC.2017.v8.n3.a2zbMath1370.05111arXiv1509.02143OpenAlexW2963668668MaRDI QIDQ2404821
Publication date: 20 September 2017
Published in: Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.02143
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Related Items (6)
Nearly-linear monotone paths in edge-ordered graphs ⋮ Turán problems for edge-ordered graphs ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ Increasing paths in countable graphs ⋮ On edge‐ordered Ramsey numbers ⋮ Long Monotone Trails in Random Edge-Labellings of Random Graphs
This page was built for publication: Monotone paths in dense edge-ordered graphs
