Covering a graph by forests and a matching

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-727427

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.