Petersburg Department of Steklov Institute of Mathematics

PREPRINT 13/2000

קשהולומיו $k$ מונועוףוכבא‎יטףס ןףפןקמשט הועוקרוק $2k$-עוגועמן ףקסתמןם חעבזו

This preprint was accepted ׃ֵ־װֲׁׂ״ 2000
Contact: ה.ק.כֱׂ׀ֿ׳

ABSTRACT:
We will prove that for every multigraph~$G(V,E)$ with edge-connectivity
$\lambda(G)\geq 2k$ contains~$k$ connected edge-disjoint spanning subgraphs
$G_1(V,E_1),$ $G_2(V,E_2),\dots,G_k(V,E_k)$ and describe the method of
construction of these subgraphs. We will prove the necessity of condition
$\lambda(G)\geq 2k$.