Generalized Tur\'an problems for small graphs

MaRDI QIDQ6344007FDO

Authors Dániel Gerbner

Publication date 29 June 2020

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Abstract: 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. We give sharp results in almost all cases, and connect the remaining cases to well-known unsolved problems. Our main new contribution is applying the progressive induction method of Simonovits for generalized Tur'an problems.

This page was built for publication: Generalized Tur\'an problems for small graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344007)