报告题目:Long cycles in graphs passing through given elements
报告人:胡智全教授,华中师范大学
报告时间:2022年5月12日下午15:00-16:00
报告地点:腾讯会议(会议号:486183692)
主持人:何伟骅
报告摘要:In this talk, we show some results on long cycles passing through given elements in a graph. In particular, we consider the following problem proposed by Locke and Zhang in [Graphs and Combinatorics 7 (1991) 265-269]: Let $G$ be a $k$-connected graph with minimum degree $d$ and $X$ a set of $m$ vertices on a cycle of $G$. For which values of $m$ and $k$, with $m>k\geq 2$, must $G$ have a cycle of length at least $min\{2d,|V(G)|\}$ passing through $X$? Fujisawa and Yamashita solved this problem for the case $k\geq 3$ and $m = k + 1$ in [Journal of Graph Theory 58 (2008), 179-190]. We provide an affirmative answer to this problem for the case of $k\geq 3$ and $ k + 1\leq m \leq \lfloor\frac{4k+1}{3}\rfloor$.
专家简介:胡智全,男,华中师范大学教授、博士生导师,主要从事结构图论研究。2001年中国科学院数学与系统科学研究院博士研究生毕业,2002至2003年在法国国家科研中心暨巴黎十一大计算机实验室从事博士后研究。曾多次访问香港大学、香港科技大学和美国佐治亚州立大学。现任中国运筹学会图论组合分会常务理事、中国组合数学与图论学会理事、湖北省运筹学会副理事长。主持国家自然科学基金面上项目5项,在Journal of Combinatorial TheoreySeries B, Journal of Graph Theory, SIAM J. on Discrete Math等杂志发表论文40余篇。