The Minimum Number of Nonnegative Edges in Hypergraphs

Electronic Journal Of Combinatorics

Hao Huang¹ 

关键词: Erdős-Ko-Rado type theorems;    nonnegative edges;    hypergraphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

An $r$-uniform $n$-vertex hypergraph $H$ is said to have the Manickam-Miklós-Singhi (MMS) property if for every assignment of weights to its vertices with nonnegative sum, the number of edges whose total weight is nonnegative is at least the minimum degre

【 授权许可】

Others