Turán Numbers for Disjoint Copies of Graphs

摘要

The Turán number ex(n,H){ex(n,mathcal H)} of H{mathcal H} is the maximum number of edges of an n-vertex simple graph having no member of H{mathcal H} as a subgraph. We show lower and upper bounds for Turán numbers for disjoint copies of graphs.