Cites work
Cited in
(23)- Problems and results in extremal combinatorics. I.
- Altitude of regular graphs with girth at least five
- Increasing paths in countable graphs
- Nearly-linear monotone paths in edge-ordered graphs
- Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
- Ramsey numbers for degree monotone paths
- The depression of a graph and \(k\)-kernels
- Trees with depression three
- Turán problems for edge-ordered graphs
- Increasing Hamiltonian paths in random edge orderings
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- On edge-ordered Ramsey numbers
- A class of graphs with depression three
- Long monotone trails in random edge-labellings of random graphs
- Most edge-orderings of \(K_{n}\) have maximal altitude
- Monotone paths in ordered graphs
- Finding monotone paths in edge-ordered graphs
- Sharp Thresholds in Random Simple Temporal Graphs
- Tiling edge-ordered graphs with monotone paths and other structures
- Edge ordered Turán problems
- On the size of temporal cliques in subcritical random temporal graphs
- Tiling problems in edge-ordered graphs (extended abstract)
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered 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)
