您的位置: 首页 > 资源和办公 > 新闻中心 > 学术报告

赖虹建(Hong-Jian Lai)教授学术讲座预告

讲座题目:  Eigenvalues and edge disjoint spanning trees of a graph

讲座时间:  2016年6月13日 16:30-17:30

讲座地点:  理学院9层学术报告厅 (924)

主讲人:  赖虹建(Hong-Jian Lai)

内容摘要:  
Seymour suggests investigating the relationship between graph eigenvalues and the spanning tree packing numbers. Cioaba and Wong in [LAA, 2012] conjectured that it is possible to use the second largest eigenvalue of a graph G to predict the number of edge disjoint spanning trees in G. This conjecture has been proved in 2014. We will report some latest progress after the proof of this conjecture.
主讲简介:  
赖虹建(Hong-Jian Lai),美国West Virginia University数学系教授,博士生导师。1988年获美国维恩州立大学(Wayne State University)理学博士学位。长期从事离散数学的教学和科研工作,主要研究方向为图的哈密顿问题,染色理论,以及相关的整数流和群连通问题。在Journal of combinatorial Theory, Journal of Graph Theory, European Journal of Combinatorics, Discrete Applied Math, Discrete Mathematics等SCI期刊发表学术论文150多篇。
正文

Seymour suggests investigating the relationship between graph eigenvalues and the spanning tree packing numbers. Cioaba and Wong in [LAA, 2012] conjectured that it is possible to use the second largest eigenvalue of a graph G to predict the number of edge disjoint spanning trees in G. This conjecture has been proved in 2014. We will report some latest progress after the proof of this conjecture.


上一篇:关于举办2016年“微分方程与生物动力学”研讨会通知

下一篇:齐远伟教授学术讲座预告(2)

快速通道

FAST TRACK