solidot新版网站常见问题，请点击这里查看。
消息
本文已被查看4023次
Generalized Tur\'an problems for disjoint copies of graphs. (arXiv:1712.07072v1 [math.CO])
来源于:arXiv
Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in
an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the
function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed
graph $F$. Our results include cases when $F$ is a complete graph, cycle or a
complete bipartite graph. 查看全文>>
