On graphs that contain exactly k copies of a subgraph, and a related problem in search theory

Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5

We study ${\mathrm{exa}}_k(n,F)$, the largest number of edges in an $n$-vertex graph $G$ that contains exactly $k$ copies of a given subgraph $F$. The case $k=0$ is the Turán number…