Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
From MaRDI portal
Publication:795067
DOI10.1016/0012-365X(84)90031-1zbMATH Open0542.05058MaRDI QIDQ795067FDOQ795067
Authors: Robert Calderbank, Fan Chung, Dean G. Sturtevant 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Graph theory (05C99)
Cites Work
Cited In (17)
- Tiling edge-ordered graphs with monotone paths and other structures
- 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
- Trees with depression three
- Problems and results in extremal combinatorics. I.
- Nearly-linear monotone paths in edge-ordered graphs
- A solution to a problem of Gargano, Lewinter and Malerba
- On edge-ordered Ramsey numbers
- Increasing Hamiltonian paths in random edge orderings
- Most edge-orderings of \(K_{n}\) have maximal altitude
- Long monotone trails in random edge-labellings of random graphs
- A class of graphs with depression three
- Sharp Thresholds in Random Simple Temporal Graphs
This page was built for publication: Increasing sequences with nonzero block sums and 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 Q795067)
