The minimum number of nonnegative edges in hypergraphs

zbMath1300.05142arXiv1309.2549MaRDI QIDQ405286

Hao Huang, Benjamin Sudakov

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsErdős-Ko-Rado-type theoremsnonnegative edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Signed and weighted graphs (05C22)

Related Items (7)

Minimum supports of eigenfunctions of graphs: a survey ⋮ A note on the Manickam-Miklós-Singhi conjecture for vector spaces ⋮ The Manickam-Miklós-Singhi conjectures for sets and vector spaces ⋮ Miklós-Manickam-Singhi conjectures on partial geometries ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
• The Manickam-Miklós-Singhi conjectures for sets and vector spaces
• An improved bound for the Manickam-Miklós-Singhi conjecture
• A note on the Manickam-Miklós-Singhi conjecture for vector spaces
• First distribution invariants and EKR theorems
• An extension of the Erdoes, Ko, Rado theorem to t-designs
• A method to count the positive 3-subsets in a set of real numbers with non-negative sum
• A linear bound on the Manickam-Miklós-Singhi conjecture
• A linear programming approach to the Manickam-Miklós-Singhi conjecture
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: The minimum number of nonnegative edges in hypergraphs