The 6-girth-thickness of the complete graph

The g-girth-thickness θ(g,G) of a graph G is the minimum number of planar subgraphs of girth at least g whose union is G. In this paper, we determine the 6-girth-thickness θ(6,Kn) of the complete g...