44 research outputs found
Nonnegative k-sums, fractional covers, and probability of small deviations
More than twenty years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that
for any integers satisfying , every set of real numbers
with nonnegative sum has at least -element subsets whose
sum is also nonnegative. In this paper we discuss the connection of this
problem with matchings and fractional covers of hypergraphs, and with the
question of estimating the probability that the sum of nonnegative independent
random variables exceeds its expectation by a given amount. Using these
connections together with some probabilistic techniques, we verify the
conjecture for . This substantially improves the best previously
known exponential lower bound . In addition we prove
a tight stability result showing that for every and all sufficiently large
, every set of reals with a nonnegative sum that does not contain a
member whose sum with any other members is nonnegative, contains at least
subsets of cardinality with
nonnegative sum.Comment: 15 pages, a section of Hilton-Milner type result adde
Large matchings in uniform hypergraphs and the conjectures of Erdos and Samuels
In this paper we study conditions which guarantee the existence of perfect
matchings and perfect fractional matchings in uniform hypergraphs. We reduce
this problem to an old conjecture by Erd\H{o}s on estimating the maximum number
of edges in a hypergraph when the (fractional) matching number is given, which
we are able to solve in some special cases using probabilistic techniques.
Based on these results, we obtain some general theorems on the minimum
-degree ensuring the existence of perfect (fractional) matchings. In
particular, we asymptotically determine the minimum vertex degree which
guarantees a perfect matching in 4-uniform and 5-uniform hypergraphs. We also
discuss an application to a problem of finding an optimal data allocation in a
distributed storage system
Perfect Packings in Quasirandom Hypergraphs II
For each of the notions of hypergraph quasirandomness that have been studied,
we identify a large class of hypergraphs F so that every quasirandom hypergraph
H admits a perfect F-packing. An informal statement of a special case of our
general result for 3-uniform hypergraphs is as follows. Fix an integer r >= 4
and 0<p<1. Suppose that H is an n-vertex triple system with r|n and the
following two properties:
* for every graph G with V(G)=V(H), at least p proportion of the triangles in
G are also edges of H,
* for every vertex x of H, the link graph of x is a quasirandom graph with
density at least p.
Then H has a perfect -packing. Moreover, we show that neither
hypotheses above can be weakened, so in this sense our result is tight. A
similar conclusion for this special case can be proved by Keevash's hypergraph
blowup lemma, with a slightly stronger hypothesis on H.Comment: 17 page