当前位置: 首页 > 科学研究 > 学术交流 > 正文
学术交流

Graphs with large maximum degree containing no edge-critical graphs

2019-10-31 10:45

报告人: 袁龙图

报告人单位: 华东师范大学

时间: 2019-11-04 10:30-11:30

地点: 卫津路校区6号楼111教

开始时间: 10:30

报告人简介: 副研究员

年: 2019

日月: 11.04


We say that a graph is edge-critical if it contains an edge whose deletion reduces the chromatic number of it. Let F be an edge-critical graph with chromatic number r+2. We determine the maximum number of edges of a graph of order n with maximum degreeΔthat contains no copy of F whenΔ<= n-ßFnSF, where ßFand SF<1 are constants depending on F. Furthermore, the unique extremal graph is a complete (r+1)-partite graph. Our result is a generalization of a result of Balister, Bollobas, Riordan and Schelp.

联系我们

地址:天津市海河教育园区雅观路135号32号教学楼,300350
邮箱: maths@tju.edu.cn
电话:+86(0)22 27402850
传真:+86(0)22 27402850

扫码关注学院最新动态