Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
From MaRDI portal
Publication:414653
DOI10.1016/j.jctb.2011.12.002zbMath1241.05100arXiv1104.1753OpenAlexW1973271905WikidataQ105583653 ScholiaQ105583653MaRDI QIDQ414653
Noga Alon, Hao Huang, Benjamin Sudakov
Publication date: 11 May 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1753
Hypergraphs (05C65) Combinatorial aspects of finite geometries (05B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The adjacency matrix of a graph as a data table: a geometric perspective, Minimum supports of eigenfunctions of graphs: a survey, MMS-type problems for Johnson scheme, Positive Sum Systems, The Erdős matching conjecture and concentration inequalities, Improved bounds for Erdős' matching conjecture, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, Extremal problems for subset divisors, The minimum number of nonnegative edges in hypergraphs, A better bound on the size of rainbow matchings, A note on the Manickam-Miklós-Singhi conjecture for vector spaces, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, On a Conjecture of Feige for Discrete Log-Concave Distributions, A remark on the problem of nonnegative \(k\)-subset sums, On Rainbow Matchings for Hypergraphs, Solution of a problem on non-negative subset sums, Divisor function inequalities, entropy, and the chance of being below average, A linear programming approach to the Manickam-Miklós-Singhi conjecture, The Manickam-Miklós-Singhi conjectures for sets and vector spaces, On the number of nonnegative sums, Miklós-Manickam-Singhi conjectures on partial geometries, A note on the Manickam-Miklós-Singhi conjecture, Rainbow matchings for 3-uniform hypergraphs, A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry, On the number of nonnegative sums for certain function, On the number of nonnegative sums for semi-partitions, A linear bound on the Manickam-Miklós-Singhi conjecture, Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- An improved bound for the Manickam-Miklós-Singhi conjecture
- The first distribution invariant of the Johnson-scheme
- First distribution invariants and EKR theorems
- On a conjecture of Manickam and Singhi
- A method to count the positive 3-subsets in a set of real numbers with non-negative sum
- Bounding Probability of Small Deviation: A Fourth Moment Approach
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Degrees giving independent edges in a hypergraph
- On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a Chebyshev-Type Inequality for Sums of Independent Random Variables
