2000 character limit reached
A conjecture on equitable vertex arboricity of graphs (1211.4998v1)
Published 21 Nov 2012 in math.CO and cs.DM
Abstract: Wu, Zhang and Li [4] conjectured that the set of vertices of any simple graph $G$ can be equitably partitioned into $\lceil(\Delta(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 $\Delta(G)\geq |G|/2$.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.