Lecturer:Yu Gexin

Abstract:

A graph is-linked if for any verticesin, we can find disjoint pathsso thathas endpointsandfor each. Graph linkage is a very important tool to study structures in graphs. In this talk, we will survey some recent results graph linkages, as well as questions related to linkage.

Introduction to the Lecturer:

Yu Gexin, Professor of the College of William and Mary in the United States, graduated from UIUC with a doctor's degree in 2006. Yu Gexin did postdoctoral research at Vanderbilt from 2006 to 2008. Yu Gexin's main research interests are graph theory and its applications. In addition to presiding over and completing a number of NSF and NSA funded projects in the United States, Yu Gexin has published more than 80 academic papers on graph coloring, graph linking and graph embedding.

Invited by:

Jin Yan, Professor at the School of Mathematics

Time:

9:00-10:00, June 13 (Monday)

Venue:

Tencent Meeting

Contact: Jin Yan Tel.: 139 6405 5656

Sponsored by: School of Mathematics, Shandong University