Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs
From MaRDI portal
Publication:2236638
Recommendations
Cites work
- scientific article; zbMATH DE number 2209719 (Why is no real title available?)
- A monotone path in an edge-ordered graph
- Altitude of regular graphs with girth at least five
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Edge-removal and non-crossing configurations in geometric graphs
- Hypergraph Ramsey numbers
- Increasing Hamiltonian paths in random edge orderings
- Increasing paths in edge ordered graphs
- Increasing paths in edge-ordered graphs: the hypercube and random graph
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs
- Large monotone paths in graphs with bounded degree
- Monotone paths in dense edge-ordered graphs
- Monotone paths in edge-ordered sparse graphs
- Most edge-orderings of \(K_{n}\) have maximal altitude
- Ramsey-type results for geometric graphs. I
- Ramsey-type results for geometric graphs. II
- Some Combinatorial Theorems on Monotonicity
- The Erdős-Sós conjecture for geometric graphs
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)
