Induced forests in regular graphs with large girth

Details Induced forests in regular graphs with large girth Induced forests in regular graphs with large girth

2007-09-20

arxiv.org/abs/0709.3126v1

Mathematics

Combinatorics

24 pages

Scientific paper

An induced forest of a graph G is an acyclic induced subgraph of G. The present paper is devoted to the analysis of a simple randomised algorithm that grows an induced forest in a regular graph. The expected size of the forest it outputs provides a lower bound on the maximum number of vertices in an induced forest of G. When the girth is large and the degree is at least 4, our bound coincides with the best bound known to hold asymptotically almost surely for random regular graphs. This results in an alternative proof for the random case.

Affiliated with

Also associated with

No associations

Rating

Induced forests in regular graphs with large girth 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 Induced forests in regular graphs with large girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Induced forests in regular graphs with large girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-517537