Title: Some extremal results with forbidden linear forests
Reporter: Prof. ZHANG Xiaodong (Shanghai Jiao Tong University)
Time: March 22, 2018(Thursday) AM 10:00-11:00
Location: A#1101 room, Innovation Park Building
Contact: Prof. WANG Yi (tel: 84708351-8128)
Abstract: (Spectral) Turán-type extremal problem asks to maximize (the spectral radius or signless Laplacian spectral radius, etc) the number of edges over all graphs which do not contain fixed forbidden subgraphs. Linear forests are graphs consisting of vertex disjoint paths. In this talk, we introduce some recent results on the Turán number, the spectral radius and signless Laplacian spectral radius of graphs with forbidden linear forests. Moreover, some conjectures and problems are included.
The brief introduction to the reporter: Zhang Xiaodong, professor and doctoral supervisor, achieved the doctorate of science from University of Science and Technology of China. He was a post-doctoral at the Israeli Institute of Technology( imbursed by Lady Davis Postdoctoral fellowship) and Chile University and he was also a visiting scholar at University of California, San Diego. He has repeatedly presided over the National Natural Science Foundation Project and participated in the national 973 and 863 projects and he has won the second prize of progress in Scientific Technology of Anhui province and the third prize of progress in Scientific Technology of the Ministry of education. He has published more than 100 papers in SCI journal and published a monograph. He had been an invitation at the Congress of Chinese Mathematicians and serves as vice chairman of China Operations Research Society for the combination in graph theory. At present, his main research fields are spectral graph theorys, random graph and complex network, combinatorial matrix theory and so on.