Covering a graph by forests and a matching

Details Covering a graph by forests and a matching Covering a graph by forests and a matching

2010-07-02

arxiv.org/abs/1007.0316v2

Mathematics

Combinatorics

Scientific paper

We prove that for any positive integer $k$, the edges of any graph whose
fractional arboricity is at most $k + 1/(3k+2)$ can be decomposed into $k$
forests and a matching.

Affiliated with

Also associated with

No associations

Rating

Covering a graph by forests and a matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Covering a graph by forests and a matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covering a graph by forests and a matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-727427