Set system blowups
In this paper, the author proves, using an ``encoding argument that given a constant \(k\geq 2\) and a large set system \(\mathcal{F}\) of sets of size at most \(w\), a typical \(k\)-tuple of sets \((S_1, \ldots, S_k)\) from \(\mathcal{F}\) can be ``blown up in the following sense: for each \(1 \leq i \leq k\), we can find a large subfamily \(\mathcal{F}_i\) containing \(S_i\) so that for \(i \neq j\), if \(T_i \in \mathcal{F}_i\) and \(T_j \in \mathcal{F}_j\), then \(T_i \cap T_j = S_i \cap S_j \). It was also shown that the answer to the multicolor version of the sunflower conjecture due to \textit{R. Alweiss} et al. [Ann. Math. (2) 194, No. 3, 795--815 (2021; Zbl 1479.05343)] is the same as the answer for the original, up to an exponential factor.
This page was built for publication: Set system blowups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6888248)
