On the Turán Number of Km ∨ C2k-1

被引:0
|
作者
Yan, Jingru [1 ]
机构
[1] Jiangsu Univ, Sch Math Sci, Zhenjiang 212013, Peoples R China
关键词
Turan number; Even wheels; Generalized wheels; TURAN NUMBERS;
D O I
10.1007/s00373-023-02728-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Given a graph H and a positive integer n, the Tur & aacute;n number of H of the order n, denoted by ex(n, H), is the maximum size of a simple graph of order n that does not contain H as a subgraph. Given graphs G and H, G boolean OR H denotes the join of G and H. In this paper, we prove ex(n, K-m boolean OR C2k-1) = [ (m+1)n(2)/2(m+2) ] for n >= 2(m + 2)k - 3(m + 2) - 1.
引用
收藏
页数:5
相关论文
共 50 条
  • [31] The Generalized Turán Number of Spanning Linear Forests
    Lin-Peng Zhang
    Ligong Wang
    Jiale Zhou
    Graphs and Combinatorics, 2022, 38
  • [32] On the rainbow planar Turán number of double stars
    He, Shunhai
    Liu, Huiqing
    DISCRETE APPLIED MATHEMATICS, 2024, 358 : 167 - 175
  • [33] The outerplanar Turán number of disjoint copies of paths
    Li, Jin
    Lan, Yongxin
    Xu, Changqing
    APPLIED MATHEMATICS AND COMPUTATION, 2025, 464
  • [34] The Turán number of directed paths and oriented cycles
    Wenling Zhou
    Binlong Li
    Graphs and Combinatorics, 2023, 39
  • [35] A New Construction for the Planar Turán Number of Cycles
    Gyori, Ervin
    Varga, Kitti
    Zhu, Xiutao
    GRAPHS AND COMBINATORICS, 2024, 40 (06)
  • [36] Exact generalized Turán number for K3 versus suspension of P4
    Mukherjee, Sayan
    DISCRETE MATHEMATICS, 2024, 347 (04)
  • [37] (k1, k2,..., km)-out-of-n system and its reliability
    Eryilmaz, Serkan
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2019, 346 : 591 - 598
  • [38] Dense circuit graphs and the planar Turán number of a cycle
    Shi, Ruilin
    Walsh, Zach
    Yu, Xingxing
    Journal of Graph Theory, 1 (27-38):
  • [40] Turán Problems for k-Geodetic Digraphs
    James Tuite
    Grahame Erskine
    Nika Salia
    Graphs and Combinatorics, 2023, 39