An inequality involving the vertex arboricity and edge arboricity of a graph

Let a(G) and a₁(G) denote the vertex arboricity and the edge arboricity of G, respectively. The inequality a(G) ? a₁(G) is proved, and this is sharp. Two related inequalities, involving another parameter, are also proved.