L. Addario-berry, F. Havet, C. L. Sales, B. Reed, and S. Thomassé, Oriented trees in digraphs, Discrete Mathematics, vol.313, issue.8, pp.313967-974, 2013.
DOI : 10.1016/j.disc.2013.01.011
URL : https://hal.archives-ouvertes.fr/inria-00551133

A. Amiri, K. Kawarabayashi, S. Kreutzer, and P. Wollan, The Erdos-Posa Property for Directed Graphs. ArXiv e-prints, 2016.

N. Alon, Disjoint Directed Cycles, Journal of Combinatorial Theory, Series B, vol.68, issue.2, pp.167-178, 1996.
DOI : 10.1006/jctb.1996.0062
URL : http://doi.org/10.1006/jctb.1996.0062

J. C. Bermond and C. Thomassen, Cycles in digraphs??? a survey, Journal of Graph Theory, vol.2, issue.269, pp.1-43, 1981.
DOI : 10.1002/jgt.3190050102

B. Bollobás and A. Thomason, Proof of a Conjecture of Mader, Erd??s and Hajnal on Topological Complete Subgraphs, European Journal of Combinatorics, vol.19, issue.8, pp.883-887, 1998.
DOI : 10.1006/eujc.1997.0188

S. Brandt and E. Dobson, The Erd??s-S??s conjecture for graphs of girth 5, Discrete Mathematics, vol.150, issue.1-3, pp.411-414, 1996.
DOI : 10.1016/0012-365X(95)00207-D

S. A. Burr, Subtrees of directed graphs and hypergraphs, Proceedings of the Eleventh Southeastern Conference on Combinatorics, Graph Theory and Computing, pp.227-239, 1980.

S. A. Burr, Antidirected subtrees of directed graphs, Bulletin canadien de math??matiques, vol.25, issue.1, pp.119-120, 1982.
DOI : 10.4153/CMB-1982-017-4

N. Cohen, F. Havet, W. Lochet, and N. Nisse, Subdivisions of oriented cycles in digraphs with large chromatic number, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01411115

M. Devos, J. Mcdonald, B. Mohar, and D. Scheide, Immersing complete digraphs, European Journal of Combinatorics, vol.33, issue.6, pp.1294-1302, 2012.
DOI : 10.1016/j.ejc.2012.02.002

A. Gabriel and . Dirac, In abstrakten graphen vorhandene vollständige 4-graphen und ihre unterteilungen, Mathematische Nachrichten, vol.22, issue.12, pp.61-85, 1960.

P. Erd?-os, Some problems in graph theory, Theory of Graphs and Its Applications, pp.29-36, 1965.

P. Erd?-os and L. Moser, On the representation of directed graphs as unions of orderings, Magyar Tud. Akad. Mat. Kutató Int. Közl, vol.9, pp.125-132, 1964.

F. Göring, Short proof of Menger's Theorem, Discrete Mathematics, vol.219, issue.1-3, pp.295-296, 2000.
DOI : 10.1016/S0012-365X(00)00088-1

P. E. Haxell, Tree embeddings, Journal of Graph Theory, vol.21, issue.3, pp.121-130, 2001.
DOI : 10.1002/1097-0118(200103)36:3<121::AID-JGT1000>3.0.CO;2-U

K. Kawarabayashi and S. Kreutzer, The Directed Grid Theorem, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15, pp.655-664, 2015.
DOI : 10.1145/2746539.2746586

J. Komlós and E. Szemerédi, Topological cliques in graphs II, Combinatorics, Probability and Computing, vol.1, issue.01, pp.79-90, 1996.
DOI : 10.1007/BF01364272

L. Lovász, Problem 2 Recent advances in graph theory, Proceedings of the Second Czechoslovak Symposium held in Prague, 1974.

W. Mader, Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Mathematische Annalen, vol.153, issue.215, pp.265-268, 1967.
DOI : 10.1007/BF01364272

W. Mader, Degree and local connectivity in digraphs, Combinatorica, vol.205, issue.2, pp.161-165, 1985.
DOI : 10.1007/BF02579379

W. Mader, Exixtence of vertices of local connectivityk in digraphs of large outdegree, Combinatorica, vol.6, issue.4, pp.533-539, 1995.
DOI : 10.1007/BF01192525

K. Menger, Zur allgemeinen kurventheorie, Fundamenta Mathematicae, vol.10, issue.1, pp.96-115, 1927.
DOI : 10.1007/bf02307626

B. Reed, N. Robertson, P. Seymour, and R. Thomas, Packing directed circuits, Combinatorica, vol.2, issue.4, pp.535-554, 1996.
DOI : 10.1007/BF01271272

J. Saclé and M. Wo´zniakwo´zniak, The Erd??s???S??s Conjecture for Graphs withoutC4, Journal of Combinatorial Theory, Series B, vol.70, issue.2, pp.367-372, 1997.
DOI : 10.1006/jctb.1997.1758

P. Seymour and C. Thomassen, Characterization of even directed graphs, Journal of Combinatorial Theory, Series B, vol.42, issue.1, pp.36-45, 1987.
DOI : 10.1016/0095-8956(87)90061-X

C. Thomassen, Some Homeomorphism Properties of Graphs, Mathematische Nachrichten, vol.174, issue.1, pp.119-133, 1974.
DOI : 10.1002/mana.19740640109

C. Thomassen, Sign-nonsingular matrices and even cycles in directed graphs, Linear Algebra and its Applications, vol.75, pp.27-41, 1986.
DOI : 10.1016/0024-3795(86)90179-5

C. Thomassen, Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number, Annals of the New York Academy of Sciences, vol.36, issue.3, pp.402-412, 1989.
DOI : 10.1007/BF01361181

C. Thomassen, K5-Subdivisions in Graphs, Combinatorics, Probability and Computing, vol.4, issue.02, pp.179-189, 1996.
DOI : 10.1016/0022-247X(68)90163-7