On the thickness and arboricity of a graph (Q1121907): Difference between revisions

We prove that the thickness and the arboricity of a graph with e edges are at most \(\lfloor \sqrt{e/3}+3/2\rfloor\) and \(\lceil \sqrt{e/2}\rceil\), respectively, and that the latter bound is best possible.