Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture

DOI10.1134/S0032946014040048zbMath1316.05089arXiv1310.0989WikidataQ101496409 ScholiaQ101496409MaRDI QIDQ2352636

Vladimir Blinovsky

Publication date: 3 July 2015

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.0989

zbMATH Keywords

Manickam-Miklós-Singhi conjectureAhlswede-Khachatrian conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

The maximum number of subset divisors of a given size, On the number of nonnegative sums for certain function, Fractional matchings in hypergraphs

Cites Work

• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
• The first distribution invariant of the Johnson-scheme
• A distribution invariant for association schemes and strongly regular graphs
• First distribution invariants and EKR theorems
• Cone dependence -- a basic combinatorial concept
• A remark on the problem of nonnegative \(k\)-subset sums
• A linear bound on the Manickam-Miklós-Singhi conjecture
• A note on the Manickam-Miklós-Singhi conjecture
• A Berry-Esseen theorem for hypergeometric probabilities under minimal conditions
• Unnamed Item
• Unnamed Item