Tur��n Numbers for Disjoint Copies of Graphs |
| |
Authors: | Izolda Gorgol |
| |
Institution: | 1. Department of Applied Mathematics, Lublin University of Technology, Nadbystrzycka 38D, 20-618, Lublin, Poland
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|