Home > News & Events > Events Content
Speaker: Yu Gexin, professor, College of William and Mary, the US.
Date: Monday, June 13, 2022
Time: 9:00-10:00
Location: Tencent Meeting
Sponsor: School of Mathematics, Shandong University
Abstract:
A graph G is k-linked if for any vertices x_1,…,x_k ,y_1,…,y_k in G, we can find disjoint paths P_1,…,P_k so that P_i has endpoints x_i and y_i for each i. 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.
For more information, please visit:
https://view.sdu.edu.cn/info/1020/166651.htm