K4$K_4$-free graphs have sparse halves

被引：1
|
作者：
Reiher, Christian [1 ]
机构：
[1] Univ Hamburg, Fachbereich Math, Hamburg, Germany
来源：
BULLETIN OF THE LONDON MATHEMATICAL SOCIETY | 2023年 / 55卷 / 03期
关键词：
D O I：
10.1112/blms.12782
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Every K4$K_4$-free graph on n$n$ vertices has a set of Ln/2<SIC> RIGHT FLOOR$\lfloor n/2\rfloor$ vertices spanning at most n2/18$n<^>2/18$ edges.
引用
收藏
页码：1178 / 1195
页数：18
相关论文
共 50 条
  • [1] Sparse halves in K 4-free graphs
    Liu, Xizhi
    Ma, Jie
    [J]. JOURNAL OF GRAPH THEORY, 2022, 99 (01) : 5 - 25
  • [2] Turán problem for K4−-free signed graphs
    Chen, Fan
    Yuan, Xiying
    [J]. Applied Mathematics and Computation, 2024, 477
  • [3] On graphs with no induced subdivision of K4
    Leveque, Benjamin
    Maffray, Frederic
    Trotignon, Nicolas
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (04) : 924 - 947
  • [4] Independent sets in {claw, K4}-free 4-regular graphs
    Kang, Liying
    Wang, Dingguo
    Shan, Erfang
    [J]. DISCRETE MATHEMATICS, 2014, 332 : 40 - 44
  • [5] ON (K4, K4 - e)-DESIGNS
    Lindner, Charles C.
    Meszka, Mariusz
    Rosa, Alex
    [J]. ARS COMBINATORIA, 2009, 93 : 333 - 340
  • [6] Strong Edge Coloring of K4 (t)-Minor Free Graphs
    Yin, Huixin
    Han, Miaomiao
    Xu, Murong
    [J]. AXIOMS, 2023, 12 (06)
  • [7] LARGE TRIANGLE-FREE SUBGRAPHS IN GRAPHS WITHOUT K4
    FRANKL, P
    RODL, V
    [J]. GRAPHS AND COMBINATORICS, 1986, 2 (02) : 135 - 144
  • [8] (2P2,K4)-FREE GRAPHS ARE 4-COLORABLE
    Gaspers, Serge
    Huang, Shenwei
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (02) : 1095 - 1120
  • [9] The chromatic number of {P5, K4}-free graphs
    Esperet, Louis
    Lemoine, Laetitia
    Maffray, Frederic
    Morel, Gregory
    [J]. DISCRETE MATHEMATICS, 2013, 313 (06) : 743 - 754
  • [10] THE INDEPENDENCE NUMBER OF CONNECTED (claw, K4)-FREE 4-REGULAR GRAPHS
    Kang, Liying
    Wang, Dingguo
    Shan, Erfang
    [J]. TAIWANESE JOURNAL OF MATHEMATICS, 2013, 17 (01): : 275 - 285
12345