# Graph problem

Printable View

• December 26th 2012, 12:48 PM
Franek222
Graph problem
I have big problem to solve, could someone help :)

Prove or disprove: If $G$ is a k-edge-connected graph and $v,v_{1},v_{2},...,v_{k}$ are $k+1$ distinct vertices of $G$ then for $i = 1,2,...k$ there exist $v-v_{i}$ paths $P_{i}$ such that each path $P_{i}$ contains exactly one vertex of ${v,v_{1},v_{2},...,v_{k}}$, namely $v_{i}$, and for $i \neq j, P_{i}$ and $P_{j}$ are edge-disjoint
• December 26th 2012, 02:05 PM
Plato
Re: Graph problem
Quote:

Originally Posted by Franek222
I have big problem to solve, could someone help :)
Prove or disprove: If $G$ is a k-edge-connected graph and $v,v_{1},v_{2},...,v_{k}$ are $k+1$ distinct vertices of $G$ then for $i = 1,2,...k$ there exist $v-v_{i}$ paths $P_{i}$ such that each path $P_{i}$ contains exactly one vertex of ${v,v_{1},v_{2},...,v_{k}}$, namely $v_{i}$, and for $i \neq j, P_{i}$ and $P_{j}$ 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 $\ge k$. That gives some bound on the number of edges.
All times are GMT -8. The time now is 05:44 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 25, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9443026185035706, "perplexity_flag": "head"}