Prove that every k-linked graph G is (2k − 1)-connected
up vote
-2
down vote
favorite
So a graph is $k$-linked if $G$ has at least $2k$ vertices, and for $x_1,ldots,x_k,y_1,ldots,y_k$ that are 2k distinct vertices there are disjoint paths $P_1,ldots,P_k$ joining $x_i$ to $y_i$.
$G$ is $(2k-1)$-connected if size of $G$ is greater than $2k-1$ and $G$ has no separator of size less than $2k-1$.
I have tried proof by contradiction but seem to be stuck, I presume it is fairly easy and am getting frustrated that I cant figure it out??
graph-theory graph-connectivity
add a comment |
up vote
-2
down vote
favorite
So a graph is $k$-linked if $G$ has at least $2k$ vertices, and for $x_1,ldots,x_k,y_1,ldots,y_k$ that are 2k distinct vertices there are disjoint paths $P_1,ldots,P_k$ joining $x_i$ to $y_i$.
$G$ is $(2k-1)$-connected if size of $G$ is greater than $2k-1$ and $G$ has no separator of size less than $2k-1$.
I have tried proof by contradiction but seem to be stuck, I presume it is fairly easy and am getting frustrated that I cant figure it out??
graph-theory graph-connectivity
1
Please use Latex/MathJax. Could you elaborate on your attempts so far?
– Stockfish
Nov 23 at 14:29
It seems reasonable to leave the title in plain ASCII here. I've added MathJax markup and $LaTeX$ syntax to the body. See this introduction to posting mathematical notation.
– hardmath
Nov 23 at 14:53
add a comment |
up vote
-2
down vote
favorite
up vote
-2
down vote
favorite
So a graph is $k$-linked if $G$ has at least $2k$ vertices, and for $x_1,ldots,x_k,y_1,ldots,y_k$ that are 2k distinct vertices there are disjoint paths $P_1,ldots,P_k$ joining $x_i$ to $y_i$.
$G$ is $(2k-1)$-connected if size of $G$ is greater than $2k-1$ and $G$ has no separator of size less than $2k-1$.
I have tried proof by contradiction but seem to be stuck, I presume it is fairly easy and am getting frustrated that I cant figure it out??
graph-theory graph-connectivity
So a graph is $k$-linked if $G$ has at least $2k$ vertices, and for $x_1,ldots,x_k,y_1,ldots,y_k$ that are 2k distinct vertices there are disjoint paths $P_1,ldots,P_k$ joining $x_i$ to $y_i$.
$G$ is $(2k-1)$-connected if size of $G$ is greater than $2k-1$ and $G$ has no separator of size less than $2k-1$.
I have tried proof by contradiction but seem to be stuck, I presume it is fairly easy and am getting frustrated that I cant figure it out??
graph-theory graph-connectivity
graph-theory graph-connectivity
edited Nov 23 at 14:51
hardmath
28.6k94994
28.6k94994
asked Nov 23 at 14:23
cxh
1
1
1
Please use Latex/MathJax. Could you elaborate on your attempts so far?
– Stockfish
Nov 23 at 14:29
It seems reasonable to leave the title in plain ASCII here. I've added MathJax markup and $LaTeX$ syntax to the body. See this introduction to posting mathematical notation.
– hardmath
Nov 23 at 14:53
add a comment |
1
Please use Latex/MathJax. Could you elaborate on your attempts so far?
– Stockfish
Nov 23 at 14:29
It seems reasonable to leave the title in plain ASCII here. I've added MathJax markup and $LaTeX$ syntax to the body. See this introduction to posting mathematical notation.
– hardmath
Nov 23 at 14:53
1
1
Please use Latex/MathJax. Could you elaborate on your attempts so far?
– Stockfish
Nov 23 at 14:29
Please use Latex/MathJax. Could you elaborate on your attempts so far?
– Stockfish
Nov 23 at 14:29
It seems reasonable to leave the title in plain ASCII here. I've added MathJax markup and $LaTeX$ syntax to the body. See this introduction to posting mathematical notation.
– hardmath
Nov 23 at 14:53
It seems reasonable to leave the title in plain ASCII here. I've added MathJax markup and $LaTeX$ syntax to the body. See this introduction to posting mathematical notation.
– hardmath
Nov 23 at 14:53
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3010421%2fprove-that-every-k-linked-graph-g-is-2k-%25e2%2588%2592-1-connected%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3010421%2fprove-that-every-k-linked-graph-g-is-2k-%25e2%2588%2592-1-connected%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
Please use Latex/MathJax. Could you elaborate on your attempts so far?
– Stockfish
Nov 23 at 14:29
It seems reasonable to leave the title in plain ASCII here. I've added MathJax markup and $LaTeX$ syntax to the body. See this introduction to posting mathematical notation.
– hardmath
Nov 23 at 14:53