Increasing paths in edge ordered graphs

DOI10.1007/BF02018469MaRDI QIDQ2554343zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Graph theory (05C99) Total orders (06A05)

Cites work

• Some Combinatorial Theorems on Monotonicity

Cited in

(21)

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