1. Aichholzer, O., Cabello, S., Fabila-Monroy, R., Flores-Peñaloza, D., Hackl, T., Huemer, C., Hurtado, F., Wood, D.R.: Edge-removal and non-crossing configurations in geometric graphs. Discrete Math. Theor. Comput. Sci. 12, 75-86 (2010)
2. Barba, L., Fabila-Monroy, R., Lara, D., Leaños, J., Rodríguez, C., Salazar, G., Zaragoza, F.: The Erdős-Sós conjecture for geometric graphs. Discrete Math. Theor. Comput. Sci. 15, 93-100 (2013)
3. Bialostocki, A., Roditty, Y.: A monotone path in an edge-ordered graph. Internat. J. Math. Math. Sci. 10, 315-320 (1987)
4. P. Brass, G. Károlyi, and P. Valtr, A Turán-type extremal theory of convex geometric graphs, in: Discrete and Computational Geometry, Algorithms Combin., vol 25. Springer (Berlin, 2003), pp. 275-300
5. M. Bucic, M. Kwan, A. Pokrovskiy, B. Sudakov, T. Tran, and A. Z. Wagner, Nearly-linear monotone paths in edge-ordered graphs, manuscript, 2018