Access the full text.
Sign up today, get DeepDyve free for 14 days.
VM Blinovsky (2014)
Minimum Number of Edges in a Hypergraph Guaranteeing a Perfect FractionalMatching and the MMS ConjectureProbl. Peredachi Inf., 50
V. Blinovsky (2014)
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjectureProblems of Information Transmission, 50
R. Ahlswede, L. Khachatrian (2003)
Cone Dependence—A Basic Combinatorial ConceptDesigns, Codes and Cryptography, 29
N. Alon, P. Frankl, Hao-wei Huang, V. Rödl, A. Rucinski, B. Sudakov (2011)
Large matchings in uniform hypergraphs and the conjectures of Erdős and SamuelsJ. Comb. Theory, Ser. A, 119
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.
Problems of Information Transmission – Springer Journals
Published: Apr 16, 2015
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.