I find this description hard to follow.
However, you may find this webpage useful.
Note that the degree of any vertex is . That gives some bound on the number of edges.
I have big problem to solve, could someone help
Prove or disprove: If is a k-edge-connected graph and are distinct vertices of then for there exist paths such that each path contains exactly one vertex of , namely , and for and are edge-disjoint
I find this description hard to follow.
However, you may find this webpage useful.
Note that the degree of any vertex is . That gives some bound on the number of edges.