Graphs with large maximum degree containing no edge-critical graphs

被引：0
|
作者：
Huo, Qingyi [1 ]
Yuan, Long-Tu [2 ]
机构：
[1] Univ Sci & Technol China, Sch Math Sci, Hefei 230026, Anhui, Peoples R China
[2] East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, 500 Dongchuan Rd, Shanghai 200240, Peoples R China
来源：
EUROPEAN JOURNAL OF COMBINATORICS | 2022年 / 106卷
基金：
中国国家自然科学基金;
关键词：
D O I：
10.1016/j.ejc.2022.103576
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We say that a graph is edge-critical if it contains an edge whose deletion reduces its chromatic number. Let F be an edge-critical graph with chromatic number r + 2. For sufficiently large n, we determine the maximum number of edges in an n-vertex graph with given maximum degree that does not contain a copy of F. Moreover, the unique extremal graph is a complete (r+1)-partite graph. (C) 2022 Elsevier Ltd. All rights reserved.
引用
收藏
页数：10
相关论文
共 50 条
  • [41] Maximum average degree of list-edge-critical graphs and Vizing's conjecture
    Harrelson, Joshua
    Reavis, Hannah
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2022, 10 (02) : 385 - 392
  • [42] THE OVERFULLNESS OF GRAPHS WITH SMALL MINIMUM DEGREE AND LARGE MAXIMUM DEGREE
    Cao, Yan
    Chen, Guantao
    Jing, Guangming
    Shan, Songling
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (03) : 2258 - 2270
  • [43] On the maximum degree of 3t-critical graphs
    Barioli, Francesco
    Merwe, Lucas Van Der
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2012, 80 : 225 - 242
  • [44] Edge-coloring critical graphs with high degree
    Miao, LY
    Wu, JL
    DISCRETE MATHEMATICS, 2002, 257 (01) : 169 - 172
  • [45] On the average degree of edge chromatic critical graphs II
    Cao, Yan
    Chen, Guantao
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 145 : 470 - 486
  • [46] LARGE PLANAR GRAPHS WITH GIVEN DIAMETER AND MAXIMUM DEGREE
    FELLOWS, M
    HELL, P
    SEYFFARTH, K
    DISCRETE APPLIED MATHEMATICS, 1995, 61 (02) : 133 - 153
  • [47] Total colorings of planar graphs with large maximum degree
    Borodin, OV
    Kostochka, AV
    Woodall, DR
    JOURNAL OF GRAPH THEORY, 1997, 26 (01) : 53 - 59
  • [48] MAXIMUM CRITICAL N-EDGE CONNECTED GRAPHS
    COZZENS, MB
    WU, SSY
    JOURNAL OF GRAPH THEORY, 1989, 13 (05) : 559 - 568
  • [49] Sizes of graphs with induced subgraphs of large maximum degree
    Erdos, P
    Reid, TJ
    Schelp, R
    Staton, W
    DISCRETE MATHEMATICS, 1996, 158 (1-3) : 283 - 286
  • [50] On injective edge-coloring of graphs with maximum degree 4
    Fu, Jiacong
    Lv, Jian-Bo
    DISCRETE APPLIED MATHEMATICS, 2025, 360 : 1 - 12
12345