Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs

DOI10.1007/s10474-021-01166-2OpenAlexW3197266201MaRDI QIDQ2236638

Carlos Hidalgo-Toscano, Pablo Pérez-Lantero, Ruy Fabila-Monroy, Frank Duque

Publication date: 25 October 2021

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

edge-ordered graphmonotone non-crossing complete binary treemonotone non-crossing path

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Turán problems for edge-ordered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Increasing paths in edge-ordered graphs: the hypercube and random graph
• Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
• A monotone path in an edge-ordered graph
• Ramsey-type results for geometric graphs. II
• Ramsey-type results for geometric graphs. I
• Altitude of regular graphs with girth at least five
• Monotone paths in edge-ordered sparse graphs
• Monotone paths in dense edge-ordered graphs
• Increasing paths in edge ordered graphs
• Increasing Hamiltonian paths in random edge orderings
• Hypergraph Ramsey numbers
• Most edge‐orderings of K_n have maximal altitude
• Some Combinatorial Theorems on Monotonicity
• The Erd\H{o}s-S\'os Conjecture for Geometric Graphs
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Large monotone paths in graphs with bounded degree

This page was built for publication: Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs