On November 2, 2021, Ben Lund from IBS Discrete Mathematics Group gave a talk on the smallest possible size of a maximal 3-wise intersecting family of subsets of {1,2,…,n} for large n, answering a problem of Erdős and Kleitman proposed in 1974. The title of his talk was “Maximal 3-wise intersecting families“.