2000 character limit reached
Equitable partition of graphs into induced linear forests
Published 14 Aug 2019 in math.CO and cs.DM | (1908.05075v1)
Abstract: It is proved that the vertex set of any simple graph $G$ can be equitably partitioned into $k$ subsets for any integer $k\geq\max{\big\lceil\frac{\Delta(G)+1}{2}\big\rceil,\big\lceil\frac{|G|}{4}\big\rceil}$ so that each of them induces a linear forest.
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.