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=\alpha(t-1)+\beta$ with $0\le\beta<t-1$. A conjecture proposed in extremal-graph form by Alon and Shikhelman~\cite{alon2016}, later stated explicitly as an exact clique-counting fo...
For graphs $H$ and $F$, let $ex(n,H,F)$ be the maximum number of copies of $H$ in an $n$-vertex $F$-free graph. We study this problem when $H$ is a clique and $F=T_t$which is a fixed tree on $t$ vertices. The Erd\H{o}s--S\'{o}s conjecture concerns the value of $ex(n,K_2, T_t)$. Gerbner and Palmer proposed a more genera...
For a graph and a graph family , let denote the maximum number of copies of in an ‐free ‐vertex graph. Let . Bai, Tompkins, and Well conjectured that is attained if and each block of the graph is a . In this paper, we determine the exact value of and the extremal graphs for all . The novelty of our proof is to give a...
Xiaojun Zhao, Yuejian Peng· Journal of Graph Theory· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
