Some Combinatorial Theorems on Monotonicity

DOI10.4153/CMB-1971-028-8zbMath0214.23503OpenAlexW2053185121MaRDI QIDQ5616733

No author found.

Publication date: 1971

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1971-028-8

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (28)

Increasing paths in edge-ordered graphs: the hypercube and random graph ⋮ Ramsey numbers for degree monotone paths ⋮ Erdős-Szekeres without induction ⋮ Finding monotone paths in edge-ordered graphs ⋮ Edge-ordered Ramsey numbers ⋮ A class of graphs with depression three ⋮ Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Sharp Thresholds in Random Simple Temporal Graphs ⋮ Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ On unimodal subsequences ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ Turán problems for 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 ⋮ Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem ⋮ Altitude of wheels and wheel-like graphs ⋮ 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 ⋮ The depression of a graph and the diameter of its line graph ⋮ On Sum-Free Subsequences ⋮ Monochromatic paths in edge-colored graphs ⋮ Increasing paths in edge ordered graphs ⋮ Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs

This page was built for publication: Some Combinatorial Theorems on Monotonicity