Xin Zhang (张欣) gave a talk on the problem of partitioning a graph into forests of the almost equal size at the Discrete Math Seminar

On February 25, 2020, Xin Zhang (张欣) from Xidian University, China gave a talk on the problem of equitable tree-k-coloring of graphs and its variations. The title of his talk is “On the equitable tree-coloring of graphs with low degeneracy“. He is currently visiting the IBS discrete mathematics group for 1 year until August 2020 for his sabbatical leave.