Speaker: Wang Weifan, distinguished professor, doctoral supervisor, Zhejiang Normal University

Date: Wednesday, June 22, 2022

Time: 9:00-10:00

Location: Tencent Meeting

Sponsor: School of Mathematics, Shandong University

Abstract:

For a positive integer n, the linear n-arboricity of a graph G is the least number k such that G can be edge-partitioned into k forests, whose component trees are paths of length at most n. When n is infinite, the corresponding parameter is called the linear arboricity of G. In this talk, we give a survey for the research progress about the arboricity, linear arboricity, linear 2-arboricity and other edge-partition problems of graphs. Some unsolved problems will be provided.

For more information, please visit:

https://view.sdu.edu.cn/info/1020/166959.htm