共 50 条
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
基金:
中国国家自然科学基金;
关键词:
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
相关论文