Arboricity Research Articles

Structural Results on Matching Estimation with Applications to Streaming

We study the problem of estimating the size of a matching when the graph is revealed in a streaming fashion. Our results are multifold:

The linear arboricity of upper-embedded graph and secondary upper-embedded graph

The linear arboricity of upper-embedded graph and secondary upper-embedded graph

On the thickness and arboricity of a graph

We prove that the thickness and the arboricity of a graph with e edges are at most ⌊ e 3 + 3 2 ⌋ and ⌈ e 2 ⌉ , respectively, and that the latter bound is best possible.