Parity of vertex cover for a graph with 2p vertices
$begingroup$
Let $G$ be a connected graph with $2p$ vertices.
We want to show that
$$frac{|VertexCover|_{min}}{|MaximalMatching|}<2$$
I started like this :
Let $G$ be a graph with $2p$ vertices such that $frac{|VertexCover|_{min}}{|MaximalMatching|}=2$.
Suppose $X$ a maximal matching of size $m$. Let $VC$ be the set of all vertices that appear in X. We can easily show that $VC$ is a vertex cover and $VC$ is of size $2m$. Since the ratio is equal to 2, $VC$ must be a minimal vertex cover.
I wanted to show that we can remove at least one vertice from $VC$ and still keep a vertex cover but I failed to do that.
Can anyone provide some help ? Is this even the correct approach for this question ?
Thanks.
graph-theory matching-theory
asked Dec 9 '18 at 14:17
mjabmjab
365
$endgroup$
add a comment |
$begingroup$
Let $G$ be a connected graph with $2p$ vertices.
We want to show that
$$frac{|VertexCover|_{min}}{|MaximalMatching|}<2$$
I started like this :
Let $G$ be a graph with $2p$ vertices such that $frac{|VertexCover|_{min}}{|MaximalMatching|}=2$.
Suppose $X$ a maximal matching of size $m$. Let $VC$ be the set of all vertices that appear in X. We can easily show that $VC$ is a vertex cover and $VC$ is of size $2m$. Since the ratio is equal to 2, $VC$ must be a minimal vertex cover.
I wanted to show that we can remove at least one vertice from $VC$ and still keep a vertex cover but I failed to do that.
Can anyone provide some help ? Is this even the correct approach for this question ?
Thanks.
graph-theory matching-theory
asked Dec 9 '18 at 14:17
mjabmjab
365
$endgroup$
add a comment |
$begingroup$
Let $G$ be a connected graph with $2p$ vertices.
We want to show that
$$frac{|VertexCover|_{min}}{|MaximalMatching|}<2$$
I started like this :
Let $G$ be a graph with $2p$ vertices such that $frac{|VertexCover|_{min}}{|MaximalMatching|}=2$.
Suppose $X$ a maximal matching of size $m$. Let $VC$ be the set of all vertices that appear in X. We can easily show that $VC$ is a vertex cover and $VC$ is of size $2m$. Since the ratio is equal to 2, $VC$ must be a minimal vertex cover.
I wanted to show that we can remove at least one vertice from $VC$ and still keep a vertex cover but I failed to do that.
Can anyone provide some help ? Is this even the correct approach for this question ?
Thanks.
graph-theory matching-theory
asked Dec 9 '18 at 14:17
mjabmjab
365
$endgroup$
Let $G$ be a connected graph with $2p$ vertices.
We want to show that
$$frac{|VertexCover|_{min}}{|MaximalMatching|}<2$$
I started like this :
Let $G$ be a graph with $2p$ vertices such that $frac{|VertexCover|_{min}}{|MaximalMatching|}=2$.
Suppose $X$ a maximal matching of size $m$. Let $VC$ be the set of all vertices that appear in X. We can easily show that $VC$ is a vertex cover and $VC$ is of size $2m$. Since the ratio is equal to 2, $VC$ must be a minimal vertex cover.
I wanted to show that we can remove at least one vertice from $VC$ and still keep a vertex cover but I failed to do that.
Can anyone provide some help ? Is this even the correct approach for this question ?
Thanks.
graph-theory matching-theory
graph-theory matching-theory
asked Dec 9 '18 at 14:17
mjabmjab
365
asked Dec 9 '18 at 14:17
mjabmjab
365
asked Dec 9 '18 at 14:17
mjabmjab
365
asked Dec 9 '18 at 14:17
mjabmjab
365
asked Dec 9 '18 at 14:17
mjabmjab
365
365
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
If there is a maximal alternating path $P$, alternating between edges in $X$ and edges not in $X$ starting and ending with edges not in $X$(alternating path is a path such that if you traverse along the path, you go through an edge in $X$ and then an edge not in $X$ and then an edge in $X$ and so on), then you could increase the size of $X$(By replacing $E(P)cap X$ with $E(P) cap (E(G)-X)$). Therefore, either a maximal alternating path start with an edge in $X$ and ends with an edge not in $X$ or starts and ends with edges in $X$. In the both cases, we can remove the end vertex of the path $P$ with is incident the the edge in $X$ to create a smaller vertex cover.
For example, in the following graph:
$X$ are the edges labeled $1$ and $VC={3,2,6,1,0,5,7,8}$. we see an alternating path from node $4$ to node $8$ in zigzag. The path ends with an edge in $X$. so we can remove node $8$. So here we didn't use that fact that $G$ has $2p$ vertices. So there could be something missing... Is this correct?
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
$endgroup$
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
add a comment |
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',
autoActivateHeartbeat: false,
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%2f3032416%2fparity-of-vertex-cover-for-a-graph-with-2p-vertices%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If there is a maximal alternating path $P$, alternating between edges in $X$ and edges not in $X$ starting and ending with edges not in $X$(alternating path is a path such that if you traverse along the path, you go through an edge in $X$ and then an edge not in $X$ and then an edge in $X$ and so on), then you could increase the size of $X$(By replacing $E(P)cap X$ with $E(P) cap (E(G)-X)$). Therefore, either a maximal alternating path start with an edge in $X$ and ends with an edge not in $X$ or starts and ends with edges in $X$. In the both cases, we can remove the end vertex of the path $P$ with is incident the the edge in $X$ to create a smaller vertex cover.
For example, in the following graph:
$X$ are the edges labeled $1$ and $VC={3,2,6,1,0,5,7,8}$. we see an alternating path from node $4$ to node $8$ in zigzag. The path ends with an edge in $X$. so we can remove node $8$. So here we didn't use that fact that $G$ has $2p$ vertices. So there could be something missing... Is this correct?
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
$endgroup$
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
add a comment |
$begingroup$
If there is a maximal alternating path $P$, alternating between edges in $X$ and edges not in $X$ starting and ending with edges not in $X$(alternating path is a path such that if you traverse along the path, you go through an edge in $X$ and then an edge not in $X$ and then an edge in $X$ and so on), then you could increase the size of $X$(By replacing $E(P)cap X$ with $E(P) cap (E(G)-X)$). Therefore, either a maximal alternating path start with an edge in $X$ and ends with an edge not in $X$ or starts and ends with edges in $X$. In the both cases, we can remove the end vertex of the path $P$ with is incident the the edge in $X$ to create a smaller vertex cover.
For example, in the following graph:
$X$ are the edges labeled $1$ and $VC={3,2,6,1,0,5,7,8}$. we see an alternating path from node $4$ to node $8$ in zigzag. The path ends with an edge in $X$. so we can remove node $8$. So here we didn't use that fact that $G$ has $2p$ vertices. So there could be something missing... Is this correct?
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
$endgroup$
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
add a comment |
$begingroup$
If there is a maximal alternating path $P$, alternating between edges in $X$ and edges not in $X$ starting and ending with edges not in $X$(alternating path is a path such that if you traverse along the path, you go through an edge in $X$ and then an edge not in $X$ and then an edge in $X$ and so on), then you could increase the size of $X$(By replacing $E(P)cap X$ with $E(P) cap (E(G)-X)$). Therefore, either a maximal alternating path start with an edge in $X$ and ends with an edge not in $X$ or starts and ends with edges in $X$. In the both cases, we can remove the end vertex of the path $P$ with is incident the the edge in $X$ to create a smaller vertex cover.
For example, in the following graph:
$X$ are the edges labeled $1$ and $VC={3,2,6,1,0,5,7,8}$. we see an alternating path from node $4$ to node $8$ in zigzag. The path ends with an edge in $X$. so we can remove node $8$. So here we didn't use that fact that $G$ has $2p$ vertices. So there could be something missing... Is this correct?
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
$endgroup$
If there is a maximal alternating path $P$, alternating between edges in $X$ and edges not in $X$ starting and ending with edges not in $X$(alternating path is a path such that if you traverse along the path, you go through an edge in $X$ and then an edge not in $X$ and then an edge in $X$ and so on), then you could increase the size of $X$(By replacing $E(P)cap X$ with $E(P) cap (E(G)-X)$). Therefore, either a maximal alternating path start with an edge in $X$ and ends with an edge not in $X$ or starts and ends with edges in $X$. In the both cases, we can remove the end vertex of the path $P$ with is incident the the edge in $X$ to create a smaller vertex cover.
For example, in the following graph:
$X$ are the edges labeled $1$ and $VC={3,2,6,1,0,5,7,8}$. we see an alternating path from node $4$ to node $8$ in zigzag. The path ends with an edge in $X$. so we can remove node $8$. So here we didn't use that fact that $G$ has $2p$ vertices. So there could be something missing... Is this correct?
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
edited Dec 9 '18 at 23:12
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
answered Dec 9 '18 at 14:29
nafhgoodnafhgood
1,797422
1,797422
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
add a comment |
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Hello, what do you mean by maximal alternating path and what's M exactly in your answer please ? And what does this "the end vertex with is incident the the edge in " mean please ? Thank you.
$endgroup$
– mjab
Dec 9 '18 at 14:37
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
$begingroup$
Sorry $M$ is actually $X$. Maximal alternating path is an alternating path that you can't extend anymore. I'm editing the answer
$endgroup$
– nafhgood
Dec 9 '18 at 14:39
add a comment |
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.
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%2f3032416%2fparity-of-vertex-cover-for-a-graph-with-2p-vertices%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
