The star arboricity sa(G) of a graph G is the minimum number of star forests which are needed to decompose all edges of G. For integers k and n, 1 <= k <= n, the crown Cn, k is the graph with vertex set {a(0), a(1),...a(n-1), b(0), b(1),...,b(n-1)} and ed
