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 -uniform, -wise intersecting family for , which improves the range of of a recent result of O'Neill and Verstraëte. Our proof also extends to -wise, -intersecting families, and from this result we obtain a version of the Erdős-Ko-Rado theorem for -wise, -intersecting families.
Our second result partially proves a conjecture of Frankl and Tokushige about -uniform families with restricted pairwise intersection sizes.
Our third result is about intersecting families of graphs. Answering a question of Ellis, we construct -intersecting families of graphs which have size larger than the Erdős-Ko-Rado-type construction, whenever is sufficiently large in terms of . The construction is based on nontrivial -wise -intersecting families of sets.
Mathematics Subject Classifications: 05D05, 05D99
Keywords: Nontrivial intersecting family, Hilton-Milner, forbidden intersection, graph intersection