What is "arboricity"

n. (context mathematics English) The minimum number of forests into which the edges of an undirected graph may be partitioned

The arboricity of an undirected graph is the minimum number of forests into which its edges can be partitioned. Equivalently it is the minimum number of spanning forests needed to cover all the edges of the graph.