The maximum size of 3-wise \(t\)-intersecting families
This paper proves a new analogous result of the Erdős-Ko-Rado theorem for 3-wise \(t\)-intersecting families where \(t\) is at least 26. The proof is similar to those originated by Frankl dealing with the original 2-wise \(t\)-intersecting problem, using the shifting operations and a random walk technique.
scientific article; zbMATH DE number 5077696