Graphs with large maximum degree containing no edge-critical graphs
被引:0
|
作者:
Huo, Qingyi
论文数: 0引用数: 0
h-index: 0
机构:
Univ Sci & Technol China, Sch Math Sci, Hefei 230026, Anhui, Peoples R ChinaUniv Sci & Technol China, Sch Math Sci, Hefei 230026, Anhui, Peoples R China
Huo, Qingyi
[1
]
Yuan, Long-Tu
论文数: 0引用数: 0
h-index: 0
机构:
East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, 500 Dongchuan Rd, Shanghai 200240, Peoples R ChinaUniv Sci & Technol China, Sch Math Sci, Hefei 230026, Anhui, Peoples R China
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
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.
机构:
Dalian Univ Technol, Sch Math Sci, Dalian, Liaoning, Peoples R ChinaDalian Univ Technol, Sch Math Sci, Dalian, Liaoning, Peoples R China
Cao, Yan
Chen, Guantao
论文数: 0引用数: 0
h-index: 0
机构:
Georgia State Univ, Dept Math & Stat, Atlanta, GA USADalian Univ Technol, Sch Math Sci, Dalian, Liaoning, Peoples R China
Chen, Guantao
Jing, Guangming
论文数: 0引用数: 0
h-index: 0
机构:
West Virginia Univ, Sch Math & Data Sci, Morgantown, WV USA
West Virginia Univ, Sch Math & Data Sci, Morgantown, WV 26506 USADalian Univ Technol, Sch Math Sci, Dalian, Liaoning, Peoples R China
Jing, Guangming
Shan, Songling
论文数: 0引用数: 0
h-index: 0
机构:
Auburn Univ, Dept Math & Stat, Auburn, AL USADalian Univ Technol, Sch Math Sci, Dalian, Liaoning, Peoples R China