Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case

arXiv2206.09334MaRDI QIDQ6402492FDOQ6402492

Authors: József Balogh, Ce Chen, Haoran Luo 

Publication date: 19 June 2022

Abstract: A family $mathcalF$ on ground set $1,2,ldots,n$ is maximal $k$-wise intersecting if every collection of $k$ sets in $mathcalF$ has non-empty intersection, and no other set can be added to $mathcalF$ while maintaining this property. ErdH{o}s and Kleitman asked for the minimum size of a maximal $k$-wise intersecting family. Complementing earlier work of Hendrey, Lund, Tompkins and Tran, who answered this question for $k=3$ and large even $n$, we answer it for $k=3$ and large odd $n$. We show that the unique minimum family is obtained by partitioning the ground set into two sets $A$ and $B$ with almost equal sizes and taking the family consisting of all the proper supersets of $A$ and of $B$. A key ingredient of our proof is the stability result by Ellis and Sudakov about the so-called $2$-generator set systems.

This page was built for publication: Maximal 3-wise Intersecting Families with Minimum Size: the Odd Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402492)