Application of hypergraph Hoffman’s bound to intersecting families

Abstract

Using the Filmus–Golubev–Lifshitz method [7] to bound the independence number of a hypergraph, we solve some problems concerning multiply intersecting families with biased measures. Among other results we obtain a stability result of a measure version of the Erdős– Ko–Rado theorem for multiply intersecting families.