Non-crossing Monotone Paths and Binary Trees in Edge-ordered Complete Geometric Graphs

Frank Duque, Ruy Fabila-Monroy, Carlos Hidalgo-Toscano +1

An edge-ordered graph is a graph with a total ordering of its edges. A path $P=v_1{v}_2\dots v_k$ in an edge-ordered graph is called increasing if $(v_i{v}_{i+1})>(v_{i+1}{v}_{i+2})$…