J. [. Alon, . M. Spencerbré73-]-l, and . Brégman, The Probabilistic Method Some properties of nonnegative matrices and their permanents, Soviet Mathematics Doklady, vol.14, pp.945-949, 1973.

M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vu?kovi´vu?kovi´c, Perfect matchings in balanced hypergraphs, Combinatorica, vol.1, issue.3, pp.325-329, 1996.
DOI : 10.1007/BF01261318

V. [. Frankl, Extremal problems on set systems, Random Structures & Algorithms, vol.48, issue.1, pp.131-164, 2002.
DOI : 10.1002/rsa.10017

]. P. Hax95 and . Haxell, A condition for matchability in hypergraphs, Graphs and Comb, vol.11, pp.245-248, 1995.

J. H. Kim, Perfect matchings in random uniform hypergraphs, Random Structures and Algorithms, vol.45, issue.2, pp.111-132, 2003.
DOI : 10.1002/rsa.10093

H. [. Katona and . Kierstead, Hamiltonian chains in hypergraphs, Journal of Graph Theory, vol.55, issue.3, pp.205-212, 1999.
DOI : 10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O
URL : https://hal.archives-ouvertes.fr/hal-01184433

]. D. Koa, D. Kühn, and . Osthus, Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree

]. D. Kob, D. Kühn, and . Osthus, Matchings in hypergraphs of large minimum degree, J. Graph Theory

]. D. Koc, D. Kühn, and . Osthus, Multicoloured Hamilton cycles and perfect matchings in pseudorandom graphs

J. Komlós, G. N. Sárközy, and E. Szemerédi, Proof of the Alon???Yuster conjecture, Discrete Mathematics, vol.235, issue.1-3, pp.255-269, 2001.
DOI : 10.1016/S0012-365X(00)00279-X

V. Rödl, A. Ruci´nskiruci´nski, and E. Szemerédi, A Dirac-type theorem for 3-uniform hypergraphs. preprint, 2004.

]. V. Vu00 and . Vu, New bounds on nearly perfect matchings in hypergraphs: higher codegrees do help. Random Struct, Algorithms, vol.17, pp.29-63, 2000.