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

M. Devos, Z. Dvo?ák, J. Fox, J. Mcdonald, B. Mohar et al., A minimum degree condition forcing complete graph immersion, Combinatorica, vol.36, issue.3, pp.279-298, 2014.
DOI : 10.1112/jlms/s1-36.1.221

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

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

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

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

C. Thomassen, Even Cycles in Directed Graphs, European Journal of Combinatorics, vol.6, issue.1, pp.85-89, 1985.
DOI : 10.1016/S0195-6698(85)80025-1