Turan Numbers for Disjoint Copies of Graphs

被引：36
作者：
Gorgol, Izolda [1 ]
机构：
[1] Lublin Univ Technol, Dept Appl Math, PL-20618 Lublin, Poland
来源：
GRAPHS AND COMBINATORICS | 2011年 / 27卷 / 05期
关键词：
Turan number; Extremal graph; Disjoint copies;
D O I：
10.1007/s00373-010-0999-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The Turan number ex(n, H) of H is the maximum number of edges of an n-vertex simple graph having no member of H as a subgraph. We show lower and upper bounds for Turan numbers for disjoint copies of graphs.
引用
收藏
页码：661 / 667
页数：7
相关论文
共 8 条
  • [1] Bollobas B., 2004, EXTREMAL GRAPH THEOR
  • [2] Diestel R., 1997, Graph Theory
  • [3] Erdos Paul, 1959, Acta Math. Acad. Sci. Hungar, V10, P337, DOI [10.1007/bf02024498, DOI 10.1007/BF02024498]
  • [4] On the Turan number for the hexagon
    Fueredi, Zoltan
    Naor, Assaf
    Verstraeate, Jacques
    [J]. ADVANCES IN MATHEMATICS, 2006, 203 (02) : 476 - 496
  • [5] HAJNAL A, 1970, MATH SOC J BOLYAI, V4, P1163
  • [6] Ore O., 1961, Ann. Mat. Pura Appl., V55, P315
  • [7] On two Turan numbers
    Shen, J
    [J]. JOURNAL OF GRAPH THEORY, 2006, 51 (03) : 244 - 250
  • [8] Simonovits M., 1968, Theory of Graphs, P279
1