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 条
  • [41] Vertex-disjoint paths in DCell networks
    Wang, Xi
    Fan, Jianxi
    Lin, Cheng-Kuan
    Jia, Xiaohua
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2016, 96 : 38 - 44
  • [42] Vertex covers by edge disjoint cliques
    Bohman, T
    Frieze, A
    Ruszinkó, M
    Thoma, L
    COMBINATORICA, 2001, 21 (02) : 171 - 197
  • [43] Vertex Covers by Edge Disjoint Cliques
    Tom Bohman
    Alan Frieze
    Miklós Ruszinkó
    Lubos Thoma
    Combinatorica, 2001, 21 : 171 - 197
  • [44] Dominator Tree Verification and Vertex-Disjoint Paths
    Georgiadis, Loukas
    Tarjan, Robert E.
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 433 - 442
  • [45] Shortest vertex-disjoint two-face paths in planar graphs
    de Verdiere, Eric Colin
    Schrijver, Alexander
    STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2008, : 181 - +
  • [46] Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs
    de Verdiere, Eric Colin
    Schrijver, Alexander
    ACM TRANSACTIONS ON ALGORITHMS, 2011, 7 (02)
  • [47] Partitioning a bipartite graph into vertex-disjoint paths
    Li, Jianping
    Steiner, George
    ARS COMBINATORIA, 2006, 81 : 161 - 173
  • [48] A Refinement of Theorems on Vertex-Disjoint Chorded Cycles
    Molla, Theodore
    Santana, Michael
    Yeager, Elyse
    GRAPHS AND COMBINATORICS, 2017, 33 (01) : 181 - 201
  • [49] Reconfiguration of vertex-disjoint shortest paths on graphs
    Saito, Rin
    Eto, Hiroshi
    Ito, Takehiro
    Uehara, Ryuhei
    Journal of Graph Algorithms and Applications, 2024, 28 (03) : 87 - 101
  • [50] Finding Arc and Vertex-Disjoint Paths in Networks
    Xie, Zheng
    Chen, Zhi
    Leng, Hongze
    Zhang, Jun
    EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2009, : 539 - +
12345