Lecturer：Xinmin Hou

Summary：

Given integer      and a     -graph     , let      be the minimum integer      such that every      -graph      on      vertices with codegree at least      contains an     -factor. For integers      and     , let     be a k-graph with two edges that shares exactly     vertices. Han and Zhao (J. Combin. Theory Ser. A, 2015) asked the following question: For all     ,      and sufficiently large      divisible by     , determine the exact value of     . In this talk, we show that      for       and      , combining with two previously known results of  R     dl, Ruci     ski and Szemer     di (J. Combin. Theory Ser. A, 2009) and Gao, Han and Zhao (CPC, 2019), the question of Han and Zhao is solved completely. We also give some discussions in this talk. (This is a joint work with Lei Yu. )

Lecturer brief introduction：

Xinmin Hou, University of Science and Technology of China

Inviter：

颜谨  数学学院教授

Time：

9月2日（周一）10:30

Place：

中心校区知新楼B座924报告厅

主办：山东大学数学学院