关于举行熊黎明教授（北京理工大学）学术报告会的通知

报告主题:   How does a necessary condition effect a graph to have hamiltonian property?

报  告  人:   熊黎明教授

报告时间:   2024年 4月29日（星期一）下午16:00-17:00

报告地点:   腾讯会议：882516007  密码：2962

邀  请  人:   林鸿莺副教授

欢迎广大师生前往！

数学学院

2024年4月27日

报告摘要：If a graph G has property A implying G also has the property B, then B is a necessary condition for G to have A. There exists some property for a graph to have it such that it is the same even we impose a necessary condition on it, while there exists some property for a graph to have it such that it is different from it if one imposes a necessary condition on it. For example, to be 2-connected is necessary condition for a graph to be hamiltonian cycle. Ore condition say that if minimum degree sum of two vertices of a graph G is at least its order, then G is Hamiltonian. If we impose a necessary condition that it has a hamiltonian path, then the condition could not be changed; while it would be changed to be that one of degree of a pair of vertices of distance two is at most half of the order of G, which be much improved than those without it. In this talk, we focus on hamiltonian property and forbidden subgraphs condition: Hamiltonian cycle or path, and so on.  

报告人介绍：熊黎明，教授，博士生导师，研究领域主要涉及经典图论问题: 包括图的结构理论，哈密尔顿问题与因子存在性及极值问题，算法复杂性等。培养博士生15名；发表图论专业学术论文130余篇，主持完成国家自然科学基金4项，正参加一项国家自然科学基金重点项目。