1. N. Alon, P. Frankl, H. Huang, V. Rödl, A. Ruciński and B. Sudakov: Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels, Journal of Combinatorial Theory, Series A 119 (2012), 1200–1215.
2. A. Asadpour, U. Feige and A. Saberi: Santa claus meets hypergraph matchings, ACM Transactions on Algorithms (TALG) 8 (2012), 24.
3. C. Annamalai, C. Kalaitzis and O. Svensson: Combinatorial algorithm for re-stricted max-min fair allocation, in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1357–1372, 2015.
4. N. Bansal and M. Sviridenko: The santa claus problem, in: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, 31–40. ACM, 2006.
5. M. Conforti, G. Cornuéjols, A. Kapoor and K. Vuőkovič: Perfect matchings in balanced hypergraphs, Combinatorica 16 (1996), 325–329.