1 paper
XiaoJun Zhao, YueJian Peng
For a fixed tree T on t vertices, let $\ex(n,K_r,T)$ denote the maximum number of r-cliques in an n-vertex T-free graph. Write n=α(t−1)+β with 0≤β<t−1. A conjecture…