Loading [MathJax]/jax/output/SVG/config.js
 
+0  
 
0
642
0
avatar+12 

let it be G=(V,E) bipartite connected graph, r- regular when r>=2.

prove that there is a path which his size is at least 2r-1.

how can I solve this?

 
difficulty advanced
 May 24, 2015

0 Online Users