Some extremal results on K_{s,t}-free graphs

30 Mar 2019 Zhang Tao Ge Gennian

For graphs $H$ and $F$, let $\text{ex}(n,H,F)$ be the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices. The study of this function, which generalizes the well-known Tur\'{a}n number of graphs, was systematically studied by Alon and Shikhelman recently... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS