Short proofs of three results about intersecting systems

Abstract

In this note, we give short proofs of three theorems about intersection problems. The first one is a determination of the maximum size of a nontrivial $k$-uniform, $d$-wise intersecting family for $n\ge \left(1+\frac{d}{2}\right)(k-d+2)$, which improves upon a recent result of O'Neill and Verstraëte. Our proof also extends to $d$-wise, $t$-intersecting families, and from this result we obtain a version of the Erdős-Ko-Rado theorem for $d$-wise, $t$-intersecting families. The second result partially proves a conjecture of Frankl and Tokushige about $k$-uniform families with restricted pairwise intersection sizes. The third result concerns graph intersections. Answering a question of Ellis, we construct $K_{s,t}$-intersecting families of graphs which have size larger than the Erdős-Ko-Rado-type construction whenever $t$ is sufficiently large in terms of $s$.

arXiv commentAdded a note about Theorem 10 and a reference