  Using the Filmus-Golubev-Lifshitz method to bound the independence number of
a hypergraph, we solve some problems concerning multiply intersecting families
with biased measure. Among other results we obtain a stability result of a
measure version of the Erdos-Ko-Rado theorem for multiply intersecting
families.

Combinatorics