Funder
National Natural Science Foundation of China
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. 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)
2. Erdős, P.: A problem on independent $$r$$-tuples. Ann. Univ. Sci.Budapest, Eötvös Sect. Math. 8, 93–95 (1965)
3. Han, J.: Perfect matchings in hypergraphs and the Erdős matching conjecture. SIAM J. Discrete Math. 30, 1351–1357 (2016)
4. Frankl, P.: Improved bounds for Erdős matching conjecture. J. Combin. Theory Ser. A 120, 1068–1072 (2013)
5. Frankl, P., Kupavskii, A.: The Erdős matching conjecture and concentration inequalities, arXiv:1806.08855