Edge arboricity : Do we need equitabilility ?
Combinatorics
2017-05-04 v2
Abstract
In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to ordinary arboricity. In other words we show that any arborescent decomposition of a graph can be transformed into an equitable one without modifying the number of used forests.
Keywords
Cite
@article{arxiv.1705.00844,
title = {Edge arboricity : Do we need equitabilility ?},
author = {Nathan Lhote and Mohammed Senhaji},
journal= {arXiv preprint arXiv:1705.00844},
year = {2017}
}
Comments
A colleague just informed me that the result is an obvious consequence of the exchange axiom in matro\"ids