Generalized Tur\'an problems for small graphs

29 Jun 2020 Gerbner Dániel

For graphs $H$ and $F$, the generalized Tur\'an number $ex(n,H,F)$ is the largest number of copies of $H$ in an $F$-free graph on $n$ vertices. We consider this problem when both $H$ and $F$ have at most four vertices... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS