Extremal Graphs for Two Vertex-Disjoint Copies of a Clique

被引：6
|
作者：
Chen, Wanfang [1 ]
Lu, Changhong [1 ]
Yuan, Long-Tu [1 ]
机构：
[1] East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai 200241, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2022年 / 38卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Clique; Hajnal and Szemered theorem; Extremal graph; TURAN NUMBER;
D O I：
10.1007/s00373-022-02467-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Applying a well-known result of Hajnal and Szemeredi, we determine the Turan number of two vertex-disjoint copies of a clique.
引用
收藏
页数：5
相关论文
共 50 条
  • [1] Extremal Graphs for Two Vertex-Disjoint Copies of a Clique
    Wanfang Chen
    Changhong Lu
    Long-Tu Yuan
    [J]. Graphs and Combinatorics, 2022, 38
  • [2] Vertex-disjoint copies of K-4(-) in graphs
    Fujita, Shinya
    [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 31 : 189 - 200
  • [3] Extremal numbers for disjoint copies of a clique
    Zhang, Junxue
    [J]. DISCRETE APPLIED MATHEMATICS, 2024, 347 : 263 - 270
  • [4] Turán number of two vertex-disjoint copies of cliques
    Hu, Caiyun
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2024,
  • [5] Vertex-disjoint paths in graphs
    Egawa, Y
    Ota, K
    [J]. ARS COMBINATORIA, 2001, 61 : 23 - 31
  • [6] Vertex-disjoint quadrilaterals in graphs
    Wang, H
    [J]. DISCRETE MATHEMATICS, 2004, 288 (1-3) : 149 - 166
  • [7] Extremal spectral results of planar graphs without vertex-disjoint cycles
    Fang, Longfei
    Lin, Huiqiu
    Shi, Yongtang
    [J]. JOURNAL OF GRAPH THEORY, 2024, 106 (03) : 496 - 524
  • [8] Vertex-disjoint claws in graphs
    Egawa, Y
    Ota, K
    [J]. DISCRETE MATHEMATICS, 1999, 197 (1-3) : 225 - 246
  • [9] Biased graphs with no two vertex-disjoint unbalanced cycles
    Chen, Rong
    Pivotto, Irene
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 130 : 207 - 245
  • [10] Graphs with many Vertex-Disjoint Cycles
    Rautenbach, Dieter
    Regen, Friedrich
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2012, 14 (02): : 75 - 82
12345