Abstract
We prove that for any positive integer , the edges of any graph whose fractional arboricity is at most can be decomposed into forests and a matching.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.