1. L. Addario-Berry, F. Havet, C. L. Sales, B. Reed and S. Thomassé: Oriented trees in digraphs, Discrete Math.
313 (2006), 967–974, 2013.
2. M. Balko, J. Cibulka, K. Král and J. Kynčl: Ramsey numbers of ordered graphs, Electronic Notes in Discrete Mathematics, 49:419–424, 2015. The Eighth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015.
3. P. Brass, G. Károlyi and P. Valtr: A Turán-type extremal theory of convex geometric graphs, In Discrete and computational geometry, volume 25 of Algorithms Combin., pages 275–300. Springer, Berlin, 2003.
4. S. A. Burr: Subtrees of directed graphs and hypergraphs, in: Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1980), Vol. I, volume 28 of Congr. Numer., 227–239, 1980.
5. V. Capoyleas and J. Pach: A Turán-type theorem on chords of a convex polygon, J. Combin. Theory Ser. B
56 (2006), 9–15, 1992.