Application of hypergraph Hoffman's bound to intersecting families
Combinatorics
2021-12-16 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2112.07965,
title = {Application of hypergraph Hoffman's bound to intersecting families},
author = {Norihide Tokushige},
journal= {arXiv preprint arXiv:2112.07965},
year = {2021}
}