Graphs with Many Copies of a Given Subgraph
Graphs with Many Copies of a Given Subgraph
复制标题
DOI：
10.37236/881
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
V. Nikiforov
中科院分区：
文献类型：
--
作者：
V. Nikiforov
We show that if a graph G of order n contains many copies of a given subgraph H, then it contains a blow-up of H of order log n.
