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 ) ≤ 8 3 admits an (I, Δ2)-partition and every graph G with mad ( G ) ≤ 14 5 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 + k k + 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.
[1]
K. Appel,et al.
Every planar map is four colorable. Part II: Reducibility
,
1977
.
[2]
André Raspaud,et al.
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
,
2010
.
[3]
Mickaël Montassier,et al.
Near-Colorings: Non-Colorable Graphs and NP-Completeness
,
2015,
Electron. J. Comb..
[4]
Alexandr V. Kostochka,et al.
Defective 2-colorings of sparse graphs
,
2014,
J. Comb. Theory B.
[5]
Alexandr V. Kostochka,et al.
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs
,
2014,
Eur. J. Comb..
[6]
K. Appel,et al.
Every planar map is four colorable. Part I: Discharging
,
1977
.
[7]
Andrzej Ruciński,et al.
Globally sparse vertex-Ramsey graphs
,
1994
.