Increasing paths in edge ordered graphs
From MaRDI portal
Publication:2554343
DOI10.1007/BF02018469zbMATH Open0243.05116OpenAlexW1975935977MaRDI QIDQ2554343FDOQ2554343
Ron 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
Cites Work
Cited In (21)
- Tiling edge-ordered graphs with monotone paths and other structures
- Ramsey numbers for degree monotone paths
- Increasing paths in countable graphs
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- The depression of a graph and \(k\)-kernels
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
- Altitude of regular graphs with girth at least five
- Finding monotone paths in edge-ordered graphs
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- Monotone paths in ordered graphs
- Trees with depression three
- Problems and results in extremal combinatorics. I.
- Long Monotone Trails in Random Edge-Labellings of Random Graphs
- Edge ordered Turán problems
- Most edge‐orderings of Kn have maximal altitude
- Turán problems for edge-ordered graphs
- Nearly-linear monotone paths in edge-ordered graphs
- Increasing Hamiltonian paths in random edge orderings
- A class of graphs with depression three
- On edge‐ordered Ramsey numbers
- Sharp Thresholds in Random Simple Temporal Graphs
This page was built for publication: Increasing paths in edge ordered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2554343)
