Differential Methods for Finding Independent Sets in Hypergraphs
Differential Methods for Finding Independent Sets in Hypergraphs
It is shown by using differential methods that if ${\cal H}$ is a double linear, r-uniform hypergraph with degree sequence $\{d_v\}$ such that any subhypergraph induced by a neighborhood has maximum degree less than m, then its independence number is at least $\sum_{v}f_{r,m}(d_v)$, where $f_{r,m}(x)$ is a convex function satisfying …