Increasing paths in edge ordered graphs
From MaRDI portal
Publication:2554343
DOI10.1007/BF02018469zbMath0243.05116OpenAlexW1975935977MaRDI QIDQ2554343
Ronald L. Graham, Daniel J. Kleitman
Publication date: 1973
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02018469
Related Items
Increasing paths in edge-ordered graphs: the hypercube and random graph, Ramsey numbers for degree monotone paths, Monotone paths in ordered graphs, Finding monotone paths in edge-ordered graphs, A class of graphs with depression three, Sharp Thresholds in Random Simple Temporal Graphs, Nearly-linear monotone paths in edge-ordered graphs, Turán problems for edge-ordered graphs, Problems and results in extremal combinatorics. I., Most edge‐orderings of Kn have maximal altitude, The depression of a graph and \(k\)-kernels, Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs, Trees with depression three, Altitude of regular graphs with girth at least five, Increasing paths in countable graphs, Increasing Hamiltonian paths in random edge orderings, On edge‐ordered Ramsey numbers, Long Monotone Trails in Random Edge-Labellings of Random Graphs, Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
Cites Work
