Turán number of two vertex-disjoint copies of cliques

被引：0
|
作者：
Hu, Caiyun [1 ]
机构：
[1] Fuzhou Univ, 2 Wulongjiang Ave,Qishan Campus, Fuzhou 350108, Minhou, Peoples R China
来源：
CZECHOSLOVAK MATHEMATICAL JOURNAL | 2024年 / 74卷 / 03期
基金：
中国国家自然科学基金; 国家重点研发计划;
关键词：
clique; Hajnal and Szemer & eacute; di theorem; Tur & aacute; n number; extremal graph; TURAN NUMBERS;
D O I：
10.21136/CMJ.2024.0461-23
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The Tur & aacute;n number of a given graph H, denoted by ex(n, H), is the maximum number of edges in an H-free graph on n vertices. Applying a well-known result of Hajnal and Szemer & eacute;di, we determine the Tur & aacute;n number ex(n, Kp boolean OR Kq) of a vertex-disjoint union of cliques Kp and Kq for all values of n.
引用
收藏
页码：759 / 769
页数：11
相关论文
共 50 条
  • [1] On Generalized Turán Number of Two Disjoint Cliques
    Xiaoli Yuan
    Weihua Yang
    Graphs and Combinatorics, 2022, 38
  • [2] Extremal Graphs for the Union of Two Vertex-Disjoint Cliques
    Zhidan Luo
    Graphs and Combinatorics, 2025, 41 (2)
  • [3] Extremal Graphs for Two Vertex-Disjoint Copies of a Clique
    Chen, Wanfang
    Lu, Changhong
    Yuan, Long-Tu
    GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [4] Extremal Graphs for Two Vertex-Disjoint Copies of a Clique
    Wanfang Chen
    Changhong Lu
    Long-Tu Yuan
    Graphs and Combinatorics, 2022, 38
  • [5] The outerplanar Turán number of disjoint copies of paths
    Li, Jin
    Lan, Yongxin
    Xu, Changqing
    APPLIED MATHEMATICS AND COMPUTATION, 2025, 464
  • [6] Independence number and vertex-disjoint cycles
    Egawa, Yoshimi
    Enomoto, Hikoe
    Jendrol, Stanislav
    Ota, Katsuhiro
    Schiermeyer, Ingo
    DISCRETE MATHEMATICS, 2007, 307 (11-12) : 1493 - 1498
  • [7] Vertex-disjoint copies of K-4(-) in graphs
    Fujita, Shinya
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 31 : 189 - 200
  • [8] ON THE NUMBER OF VERTEX-DISJOINT CYCLES IN DIGRAPHS
    Bai, Yandong
    Manoussakis, Yannis
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (04) : 2444 - 2451
  • [9] Generalized Turán results for disjoint cliques
    Gerbner, Daniel
    DISCRETE MATHEMATICS, 2024, 347 (07)
  • [10] Two vertex-disjoint cycles in a graph
    Wang, H
    GRAPHS AND COMBINATORICS, 1995, 11 (04) : 389 - 396
12345