Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
From MaRDI portal
Publication:2236638
DOI10.1007/S10474-021-01166-2OpenAlexW3197266201MaRDI QIDQ2236638FDOQ2236638
Authors: R. Fabila-Monroy, Carlos Hidalgo-Toscano, P. Pérez-Lantero, 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
Recommendations
Cites Work
- Ramsey-type results for geometric graphs. II
- Ramsey-type results for geometric graphs. I
- Monotone paths in edge-ordered sparse graphs
- Increasing paths in edge ordered graphs
- Increasing Hamiltonian paths in random edge orderings
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- Some Combinatorial Theorems on Monotonicity
- Large monotone paths in graphs with bounded degree
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- A monotone path in an edge-ordered graph
- Altitude of regular graphs with girth at least five
- Hypergraph Ramsey numbers
- Title not available (Why is that?)
- Edge-removal and non-crossing configurations in geometric graphs
- The Erdős-Sós conjecture for geometric graphs
- Monotone paths in dense edge-ordered graphs
- Most edge-orderings of \(K_{n}\) have maximal altitude
Cited In (5)
This page was built for publication: Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2236638)
