A remark on the problem of nonnegative \(k\)-subset sums

DOI10.1134/S0032946012040059zbMath1261.05125OpenAlexW1990600459WikidataQ105584109 ScholiaQ105584109MaRDI QIDQ1945146

Vladimir Blinovsky, Harout Aydinian

Publication date: 3 April 2013

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

Full work available at URL: https://doi.org/10.1134/s0032946012040059

zbMATH Keywords

perfect fractional matching

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

A note on the Manickam-Miklós-Singhi conjecture for vector spaces ⋮ The Manickam-Miklós-Singhi conjectures for sets and vector spaces ⋮ Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture

Cites Work

• Unnamed Item
• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
• An improved bound for the Manickam-Miklós-Singhi conjecture
• 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 method to count the positive 3-subsets in a set of real numbers with non-negative sum

This page was built for publication: A remark on the problem of nonnegative \(k\)-subset sums