Abstract
We find an exact formula for the minimum number of edges in a hypergraph which guarantees a fractional matching of cardinality s in the case where sn is an integer.
Similar content being viewed by others
References
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].
Ahlswede, R. and Khachatrian, L., Cone Dependence-A Basic Combinatorial Concept, Des. Codes Cryptogr., 2003, vol. 29, no. 1–3, pp. 29–40.
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.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.M. Blinovsky, 2015, published in Problemy Peredachi Informatsii, 2015, Vol. 51, No. 1, pp. 29–35.
Supported by FAPESP, project nos. 2012/13341-8 and 2013/07699-0, and NUMEC/USP, project MaCLinC/USP.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M. Fractional matchings in hypergraphs. Probl Inf Transm 51, 25–30 (2015). https://doi.org/10.1134/S0032946015010032
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946015010032