On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree

Abstract

Given a graph G=(V,E), if its vertex set V(G) can be partitioned into two non-empty subsets V1 and V2 such that G[V1] is edgeless and G[V2] is a graph with maximum degree at most k, then we say that G admits an (I, Δk)-partition. A similar definition can be given for the notation (I, Fk)-partition if G[V2] is a forest with maximum degree at most k.The maximum average degree of G is defined to be mad(G)=max{2|E(H)||V(H)|:H⊆G}. Borodin and Kostochka (2014) proved that every graph G with mad(G)≤83 admits an (I, Δ2)-partition and every graph G with mad(G)≤145 admits an (I, Δ4)-partition. In this paper, we obtain a strengthening result by showing that for any k ≥ 2, every graph G with mad(G)≤2+kk+1 admits an (I, Fk)-partition. As a corollary, every planar graph with girth at least 7 admits an (I, F4)-partition and every planar graph with girth at least 8 admits an (I, F2)-partition. The later result is best possible since neither girth condition nor the class of F2 can be further improved.