Graph Theory Seminar - Tom Kelly

Title: Large induced forests in subcubic and planar graphs

Abstract: We are interested in finding lower bounds on the size of largest induced forests for different classes of graphs.  First we discuss recent work improving bounds for subcubic graphs of girth four and five.  Second we survey some open problems and recent results for planar graphs.  Finally, we show how we can prove a new bound for planar graphs of girth five by reducing it to the subcubic case. Joint work with Chun-Hung Liu.