New relation between arboricity and edges of graph

Denote, respectively, the arboricity, ??,?,?? let G be a graph with n vertices and m edge and thickness and outer thickness of G . We establish inequalities; each of which is best possible up to a constant, between pairs of these parameters. In particular, we show.