Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference3 articles.
1. Blinovsky, V.M., Minimum Number of Edges in a Hypergraph Guaranteeing a Perfect FractionalMatching and the MMS Conjecture, Probl. Peredachi Inf., 2014, vol. 50, no. 4, pp. 43–54 [Probl. Inf. Trans. (Engl. Transl.), 2014, vol. 50, no. 4, pp. 340–349].
2. Ahlswede, R. and Khachatrian, L., Cone Dependence-A Basic Combinatorial Concept, Des. Codes Cryptogr., 2003, vol. 29, no. 1–3, pp. 29–40.
3. Alon, N., Frankl, P., Huang, H., Rödl, V., Ruciński, A., and Sudakov, B., Large Matchings in Uniform Hypergraphs and the Conjectures of Erdős and Samuels, J. Combin. Theory Ser. A, 2012, vol. 119, no. 6, pp. 1200–1215.