2012/11/21 by Zhang, Xin, Wu, Jian-Liang
#Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.1211.4998
Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph G can be equitably partitioned into \lceil(Δ(G)+1)/2\rceil subsets so that each of them induces a forest of G. In this note, we prove this conjecture for graphs G with Δ(G)≥ |G|/2.