Skip to main content
Log in

Fractional matchings in hypergraphs

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  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].

    MathSciNet  Google Scholar 

  2. Ahlswede, R. and Khachatrian, L., Cone Dependence-A Basic Combinatorial Concept, Des. Codes Cryptogr., 2003, vol. 29, no. 1–3, pp. 29–40.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. M. Blinovsky.

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

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Blinovsky, V.M. Fractional matchings in hypergraphs. Probl Inf Transm 51, 25–30 (2015). https://doi.org/10.1134/S0032946015010032

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946015010032

Keywords

Navigation