学术报告(Shuto Nishida 11.26)

离散数学学术报告--Existence of 3-factors in star-free graphs with high connectivity

发布人:周妍 发布日期:2018-11-06
主题
离散数学学术报告--Existence of 3-factors in star-free graphs with high connectivity
活动时间
-
活动地址
数学楼416讲学厅
主讲人
Shuto Nishida 博士(Tokyo University of Science)

摘要:

A graph is called K_1,t-free (or t-star-free) if it contains no K_1,t (or t-star ) as an induced subgraph. We call a spanning r-regular subgraph of a graph an r-factor. Ota and Tokuda gave a minimum degree condition for a K_1,t-free graph to have an r-factor [J. Graph Theory 22 (1996), 59{64]. Though their condition is best-possible, their sharpness examples have connectivity one. After that, some researchers have tried to improve the minimum degree condition by assuming larger connectivity. In this talk, we focus on a sufficient degree condition for the existence of 3-factors in star-free graphs with high connectivity.

 

数学学院

2018年11月6日