报告名称：

A Minimum Degree Condition For Weakly Bipancyclism

报告作者：

胡智全

作者简介：

所在学校：

华中师范大学

职称：

教授

其他：

报告时间：

2014年12月2日（星期二）上午10：00-11:00

报告地点：

数统学院201报告厅

报告摘要：

We investigate the set of cycle lengths occurring in bipartite graphs with large minimum degree. A bipartite graph is weakly bipancyclic if it contains cycles of every even length between the length of a shortest and longest cycle. In this talk, it is shown that every balanced bipartite graph on 2n vertices with minimum degree at least n/3 + 5 is weakly bipancyclic (of girth 4).