Increasing paths in edge-ordered graphs: the hypercube and random graph

zbMath1335.05150arXiv1502.03146MaRDI QIDQ281608

Jessica De Silva, Florian Pfender, Theodore Molla, Michael Tait, Troy Retter

Publication date: 11 May 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03146

zbMATH Keywords

hypercuberandom graphedge-orderingincreasing path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

Nearly-linear monotone paths in edge-ordered graphs ⋮ Turán problems for edge-ordered graphs ⋮ Most edge‐orderings of K_n have maximal altitude ⋮ Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs ⋮ Long Monotone Trails in Random Edge-Labellings of Random Graphs

Cites Work

• Unnamed Item
• Finding monotone paths in edge-ordered graphs
• Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
• Problems and results in extremal combinatorics. I.
• Monotone paths in edge-ordered sparse graphs
• Increasing paths in edge ordered graphs
• Increasing Hamiltonian paths in random edge orderings
• Some Combinatorial Theorems on Monotonicity
• Optimal Assignments of Numbers to Vertices
• Large monotone paths in graphs with bounded degree

This page was built for publication: Increasing paths in edge-ordered graphs: the hypercube and random graph