Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs

DOI10.1016/0012-365X(84)90031-1zbMath0542.05058MaRDI QIDQ795067

Fan R. K. Chung, Robert Calderbank, Dean G. Sturtevant

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complete graphlabelled graphsincreasing sequenceincreasing edge labels

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Permutations, words, matrices (05A05) Graph theory (05C99)

Related Items

Increasing paths in edge-ordered graphs: the hypercube and random graph, 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, Problems and results in extremal combinatorics. I., Most edge‐orderings of K_n 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 Hamiltonian paths in random edge orderings, On edge‐ordered Ramsey numbers, Long Monotone Trails in Random Edge-Labellings of Random Graphs

Cites Work

• Increasing paths in edge ordered graphs
• Some Combinatorial Theorems on Monotonicity