Counting $t$-wise $L$-intersecting cliques with prescribed intersection sizes

Abstract

Let $r,t\ge 3$ be integers and $L=\{{\ell }_1,{\ell }_2,\dots ,{\ell }_s\}\subseteq [0,r-1]$ a fixed set of integers with $|L|\ne r$ and ${\ell }_1<{\ell }_2<\cdots <{\ell }_s$. For each integer $n$, let ${\Psi }_r(n,L,t)$ be the maximum number of $r$-cliques in an $n$-vertex graph whose $r$-cliques, viewed as a family of $r$-subsets of the vertex set, form a $t$-wise $L$-intersecting family. In this paper, we prove that ${\Psi }_r(n,L,t)=o(n^{|L|})$ when the sequence ${\ell }_1,{\ell }_2,\dots ,{\ell }_s,r$ does not form an arithmetic progression, and we give an asymptotic formula for ${\Psi }_r(n,L,t)$ when this sequence does form an arithmetic progression. When $t=2$, our results are exactly Helliar and Liu's results.