Author:
Lang Richard,Sanhueza-Matamala Nicolás
Publisher
Springer International Publishing
Reference24 articles.
1. Alon, N., Frankl, P., Huang, H., Rödl, V., Ruciński, A., Sudakov, B.: Large matchings in uniform hypergraphs and the conjecture of Erdős and Samuels. J. Combin. Theory Ser. A 119(6), 1200–1215 (2012)
2. Berge, C.: Balanced matrices. Math. Program. 2(1), 19–31 (1972)
3. Bermond, J.-C., Germa, A., Heydemann, M.-C., Sotteau, D.: Hypergraphes hamiltoniens. Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS, vol. 260, pp. 39–43. CNRS, Paris (1978)
4. Cooley, O., Mycroft, R.: The minimum vertex degree for an almost-spanning tight cycle in a $$3$$-uniform hypergraph. Discret. Math. 340(6), 1172–1179 (2017)
5. Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 3(1), 69–81 (1952)