A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings

Alon, N., Frankl, P., Huang, H., Rödl, V., Ruciński, A., Sudakov, B.: Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Combin. Theory Ser. A 119, 1200–1215 (2012)

Erdős, P.: A problem on independent $$r$$-tuples. Ann. Univ. Sci.Budapest, Eötvös Sect. Math. 8, 93–95 (1965)

Han, J.: Perfect matchings in hypergraphs and the Erdős matching conjecture. SIAM J. Discrete Math. 30, 1351–1357 (2016)

Frankl, P.: Improved bounds for Erdős matching conjecture. J. Combin. Theory Ser. A 120, 1068–1072 (2013)

Frankl, P., Kupavskii, A.: The Erdős matching conjecture and concentration inequalities, arXiv:1806.08855

Kühn, D., Osthus, D., Townsend, T.: Fractional and integer matchings in uniform hypergraphs. European J. Combin. 38, 83–96 (2014)

Rödl, V., Ruciński, A., Szemerédi, E.: Perfect matchings in uniform hypergraphs with large minimum degree. European J. Combin. 27, 1333–1349 (2006)

Rödl, V., Ruciński, A., Szemerédi, E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Comb. Theory Ser. A 116, 613–636 (2009)

Treglown, A., Zhao, Y.: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs I. J. Comb. Theory Ser. A 119, 1500–1522 (2012)

Treglown, A., Zhao, Y.: Exact minimum degree thresholds for perfect matchings in uniform hypergraphs II. J. Comb. Theory Ser. A 120, 1463–1482 (2013)