Cvetkvic-Rowlinson 猜想的证明

创建时间:  2019/12/26  龚惠英   浏览次数:   返回

报告主题:Cvetkvic-Rowlinson 猜想的证明
报告人:宁博教授(天津大学)
报告时间:2019年12月26日(周四)16:00-17:00
报告地点:校本部G508
邀请人:康丽英
主办部门:理学院数学系
报告摘要:
   In 1990, Cvetkovi´c and Rowlinson conjectured that among all outerplanar graphs on n vertices, K1∨Pn−1 attains the maximal spectral radius. Very recently, Tait and Tobin confirmed this conjecture for sufficiently large graphs. In this talk, we first survey several results about planarity of graphs in spectral graph theory. We mainly give a sketch of a proof of this conjecture for n ≥ 17.            

 

 

                             欢迎教师、学生参加!

上一条: A criterion for the modular isomorphism problem

下一条:Homological branching laws


Cvetkvic-Rowlinson 猜想的证明

创建时间:  2019/12/26  龚惠英   浏览次数:   返回

报告主题:Cvetkvic-Rowlinson 猜想的证明
报告人:宁博教授(天津大学)
报告时间:2019年12月26日(周四)16:00-17:00
报告地点:校本部G508
邀请人:康丽英
主办部门:理学院数学系
报告摘要:
   In 1990, Cvetkovi´c and Rowlinson conjectured that among all outerplanar graphs on n vertices, K1∨Pn−1 attains the maximal spectral radius. Very recently, Tait and Tobin confirmed this conjecture for sufficiently large graphs. In this talk, we first survey several results about planarity of graphs in spectral graph theory. We mainly give a sketch of a proof of this conjecture for n ≥ 17.            

 

 

                             欢迎教师、学生参加!

上一条: A criterion for the modular isomorphism problem

下一条:Homological branching laws