Natural Proof of Tree Partition Number of Complete Multipartite Graphs
Wang Hua-ping · Shuxue de shijian yu renshi · 2009
Tree partition number tr(G) of an edge r-colored graph G is defined to be the least positive integer k,such that if G is colored with r colors,there are at most k vertex disjoint monochromatic trees which cover all the vertices of G.Kaneko et al.determined the expression of t2(K(n1,n2,…,nk)).In this paper,we gave an natural proof of the result.