Alon, N., Frankl, P., Huang, H., Rödl, V., Ruciński, A. and Sudakov, B. On the existence of large matchings and fractional matchings in uniform hypergraphs. Submitted.
Bollobás, B., Daykin, D. E. and Erdős, P. (1976) Sets of independent edges of a hypergraph. Quart. J. Math. Oxford (2) 27 25–32.
Erdős, P. (1965) A problem on independent r-tuples. Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 8 93–95.
Erdős, P. and Gallai, T. (1959) On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10 337–356.
Frankl, P. (1987) The shifting technique in extremal set theory. In Surveys in Combinatorics, Vol. 123 of London Mathematical Society Lecture Notes, Cambridge University Press, pp. 81–110.
Frankl, P. and Füredi, Z. Unpublished.
Huang, H., Loh, P. and Sudakov, B. The size of a hypergraph and its matching number. Submitted.
Khan, I. Perfect matchings in 4-uniform hypergraphs. Submitted.
Lo, A. and Markström, K.F-factors in hypergraphs via absorption. Submitted.
Markström, K. and Ruciński, A. (2011) Perfect matchings and Hamilton cycles in hypergraphs with large degrees. Europ. J. Combin. 32 677–687.
Rödl, V. and Ruciński, A. (2010) Dirac-type questions for hypergraphs: A survey (or more problems for Endre to solve). In An Irregular Mind: Szemerédi is 70, Vol. 21 of Bolyai Soc. Math. Studies, pp. 561–590.