User ermelinda delavina - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-19T03:09:27Z http://mathoverflow.net/feeds/user/7575 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/31554/is-the-feedback-vertex-number-bounded-by-the-maximum-number-of-leaves-in-a-spanni/31763#31763 Answer by Ermelinda DeLaVina for Is the feedback vertex number bounded by the maximum number of leaves in a spanning tree? Ermelinda DeLaVina 2010-07-13T21:06:17Z 2010-07-13T21:06:17Z <p>Bill Waller and I proved the stronger statement that for G a graph on n(G) > 1 vertices, the order of a largest induced linear forest is at least one plus the connected domination number. See our <a href="http://cms.dt.uh.edu/faculty/delavinae/research/DelavinaWaller2009.pdf" rel="nofollow">preprint</a>. A linear forest is a forest in which each connected component is a path, and clearly a lower bound for the order of a largest forest.</p>