报告主题：Arboricity and Partition
报告人：王维凡（浙江师范大学）
报告时间：2022年4月1日（周五） 15:30
参会方式：腾讯会议
会议ID：265-459-943
邀请人：康丽英
报告摘要：
For a positive integer n, the linear n-arboricity of a graph is the least number k such that it 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 graphs. In this talk, we give a survey on the research progress on the arboricity, linear arboricity, linear 2-arboricity and other edge-partition problems of graphs. Some open problems will be provided.