Year: 2019
Type: preprint
Abstract: We prove that for $k \in \mathbb{N}$ and $d \leq 2k+2$, if a graph has maximum average degree at most $2k + \frac{2d}{d+k+1}$, then $G$ decomposes into $k+1$ pseudoforests, where one of the pseudoforests has all connected components having at most $d$ edges.
Source: arXiv (Cornell University)
Authors: Grout, Logan, Moore, Benjamin
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2942389368