Short proofs of three results about intersecting systems

arXiv2104.00778MaRDI QIDQ6364376FDOQ6364376

Authors: József Balogh 

Publication date: 1 April 2021

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 $ngeleft(1+fracd2ight)(k-d+2)$, which improves upon a recent result of O'Neill and Verstra"{e}te. Our proof also extends to $d$-wise, $t$-intersecting families, and from this result we obtain a version of the ErdH{o}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 ErdH{o}s-Ko-Rado-type construction whenever $t$ is sufficiently large in terms of $s$.

This page was built for publication: Short proofs of three results about intersecting systems

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