|
Colussi, Conforti and Zambelli conjectured that in a rooted k-edge-connected digraph there exist k strongly edge-disjoint arborescences, and also gave a proof for k=2. In this paper, we give a generalization of the case k=2 and show that the conjecture does not hold for larger values of k.
Bibtex entry:
| AUTHOR | = | {B{\'e}rczi, Krist{\'o}f and B{\'e}rczi-Kov{\'a}cs Ren{\'a}ta, Erika}, |
| TITLE | = | {A Note On Strongly Edge-Disjoint Arborescences}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2011}, |
| NUMBER | = | {TR-2011-04} |