华中师范大学胡智全教授学术报告11月5日上午
发布时间: 2017-10-31 访问次数: 15


报告题目:Long Cycles Passing Through Given Elements in a Graph


报告时间:2017115 (星期天) 9:30--10:30


报告地点:旗山校区理工楼601报告厅


报告摘要:In this talk, we show some results on long cycles through given elements ina graph. In particular, we consider the following problem proposed by Locke and Zhangin [Graphs and Combinatorics 7 (1991) 265-269]: Let G be a k-connected graph withminimum degree d and X a set of m vertices on a cycle of G. For which values of mand k, with m > k2, must G have a cycle of length at least min{2d|V (G)|}passingthrough X? Fujisawa and Yamashita solved this problem for the case k3 and m=k+1in [Journal of Graph Theory 58 (2008), 179-190]. We provide an affirmative answer tothis problem for the case of k3 and k+1m(4k+1)/3. This is a joint work withFeifei Song.


专家简介:胡智全,理学博士、华中师范大学数学与统计系教授、博士生导师。2001年中国科学院数学与系统科学研究院博士毕业,20022003年获法国国家博士后奖学金赴法国国家科研中心暨巴黎十一大计算机试验室从事博士后研究。曾多次访问香港大学、香港科技大学和美国佐治亚州立大学。现任中国组合数学与图论学会理事、湖北省运筹学会副理事长。主要从事结构图论研究,先后主持国家自然科学基金面上项目5项、教育部科学技术研究重点项目1项,在Journal of Combinatorial Theory Series BJournal of Graph TheoryJournal of Combinatorial OptimizationSIAM J. Discrete MathematicsDiscrete Applied MathematicsSCI期刊上发表论文30余篇。