Sam Spiro

Supersaturation for Hypergraph-Weighted Independent Sets

Many extremal problems can be viewed as finding large independent sets in an auxiliary hypergraph. We propose a generalization of this by looking for ``large''independent sets $I$ in a hypergraph $\mathcal{F}$ where ``large''is measured by how many edges $I$ induces in another hypergraph $\mathcal{H}$ on the same verte...