Mixing
Antimatching in revolving door graph
$begingroup$
$RD^d$ is bipartite graph in which the vertices are $(d−1)$-element subsets and $d$-element subsets of a $(2d−1)$-element ground set. Two vertices are adjacent if one of the corresponding sets is a subset of the other.
My question is why any edge together with its incident edges defines an antimatching of $2d-1$ edges? And why $2d-1$?
Answer probably is related to the fact that this graph is $d$-regular but I have problem to justify it.
graph-theory
asked Jan 18 at 14:48
KateKate
104
$endgroup$
add a comment |
$begingroup$
$RD^d$ is bipartite graph in which the vertices are $(d−1)$-element subsets and $d$-element subsets of a $(2d−1)$-element ground set. Two vertices are adjacent if one of the corresponding sets is a subset of the other.
My question is why any edge together with its incident edges defines an antimatching of $2d-1$ edges? And why $2d-1$?
Answer probably is related to the fact that this graph is $d$-regular but I have problem to justify it.
graph-theory
asked Jan 18 at 14:48
KateKate
104
$endgroup$
add a comment |
$begingroup$
$RD^d$ is bipartite graph in which the vertices are $(d−1)$-element subsets and $d$-element subsets of a $(2d−1)$-element ground set. Two vertices are adjacent if one of the corresponding sets is a subset of the other.
My question is why any edge together with its incident edges defines an antimatching of $2d-1$ edges? And why $2d-1$?
Answer probably is related to the fact that this graph is $d$-regular but I have problem to justify it.
graph-theory
asked Jan 18 at 14:48
KateKate
104
$endgroup$
$RD^d$ is bipartite graph in which the vertices are $(d−1)$-element subsets and $d$-element subsets of a $(2d−1)$-element ground set. Two vertices are adjacent if one of the corresponding sets is a subset of the other.
My question is why any edge together with its incident edges defines an antimatching of $2d-1$ edges? And why $2d-1$?
Answer probably is related to the fact that this graph is $d$-regular but I have problem to justify it.
graph-theory
graph-theory
asked Jan 18 at 14:48
KateKate
104
asked Jan 18 at 14:48
KateKate
104
asked Jan 18 at 14:48
KateKate
104
asked Jan 18 at 14:48
KateKate
104
asked Jan 18 at 14:48
KateKate
104
104
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Let $G$ be a $d$-regular bipartite graph. And let $e_{uv}$ be an edge of $G$.
Let $S$ the set of $e_{uv}$ and all its adjacent edges. Then the size of $S$ is $2d-1$ : They are $d$ edges connected at the vertex $u$, and $d$ connected at vertex $v$. As we double count $e_{uv}$, we reduce the count by one, and $|S|=2d-1$.
Recall that an antimatching $A$ of $G$ is a set of edges such that two edges are at most at distance 2, and that the distance between two edges is defined as the distance between corresponding vertices in $L(G)$ (the Line graph of $G$).
As all edges from $S$ are connected to $e_{uv}$, then the maximum distance between edges of $S$ is 2.
Therefore $S$ is an antimatching of size $2d-1$.
I think that's all to proove. (I never studied antimatching before, I might be missing something).
Note An antimatching can also be defined (equivalently) as a subgraph with no induced matching of size greater than 1. This is also clearly the case for $S$ :
Suppose there exist an induced matching of size 2 in $S$. Then it must contains one edge connected to $u$ and one connected to $v$. But then in order to be induced we would need to include $e_{uv}$, and would not be a matching. Hence a contradiction.
Therefore the only induced matching of $S$ have size 1.
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
$endgroup$
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%2f3078336%2fantimatching-in-revolving-door-graph%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$
Let $G$ be a $d$-regular bipartite graph. And let $e_{uv}$ be an edge of $G$.
Let $S$ the set of $e_{uv}$ and all its adjacent edges. Then the size of $S$ is $2d-1$ : They are $d$ edges connected at the vertex $u$, and $d$ connected at vertex $v$. As we double count $e_{uv}$, we reduce the count by one, and $|S|=2d-1$.
Recall that an antimatching $A$ of $G$ is a set of edges such that two edges are at most at distance 2, and that the distance between two edges is defined as the distance between corresponding vertices in $L(G)$ (the Line graph of $G$).
As all edges from $S$ are connected to $e_{uv}$, then the maximum distance between edges of $S$ is 2.
Therefore $S$ is an antimatching of size $2d-1$.
I think that's all to proove. (I never studied antimatching before, I might be missing something).
Note An antimatching can also be defined (equivalently) as a subgraph with no induced matching of size greater than 1. This is also clearly the case for $S$ :
Suppose there exist an induced matching of size 2 in $S$. Then it must contains one edge connected to $u$ and one connected to $v$. But then in order to be induced we would need to include $e_{uv}$, and would not be a matching. Hence a contradiction.
Therefore the only induced matching of $S$ have size 1.
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
$endgroup$
add a comment |
$begingroup$
Let $G$ be a $d$-regular bipartite graph. And let $e_{uv}$ be an edge of $G$.
Let $S$ the set of $e_{uv}$ and all its adjacent edges. Then the size of $S$ is $2d-1$ : They are $d$ edges connected at the vertex $u$, and $d$ connected at vertex $v$. As we double count $e_{uv}$, we reduce the count by one, and $|S|=2d-1$.
Recall that an antimatching $A$ of $G$ is a set of edges such that two edges are at most at distance 2, and that the distance between two edges is defined as the distance between corresponding vertices in $L(G)$ (the Line graph of $G$).
As all edges from $S$ are connected to $e_{uv}$, then the maximum distance between edges of $S$ is 2.
Therefore $S$ is an antimatching of size $2d-1$.
I think that's all to proove. (I never studied antimatching before, I might be missing something).
Note An antimatching can also be defined (equivalently) as a subgraph with no induced matching of size greater than 1. This is also clearly the case for $S$ :
Suppose there exist an induced matching of size 2 in $S$. Then it must contains one edge connected to $u$ and one connected to $v$. But then in order to be induced we would need to include $e_{uv}$, and would not be a matching. Hence a contradiction.
Therefore the only induced matching of $S$ have size 1.
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
$endgroup$
add a comment |
$begingroup$
Let $G$ be a $d$-regular bipartite graph. And let $e_{uv}$ be an edge of $G$.
Let $S$ the set of $e_{uv}$ and all its adjacent edges. Then the size of $S$ is $2d-1$ : They are $d$ edges connected at the vertex $u$, and $d$ connected at vertex $v$. As we double count $e_{uv}$, we reduce the count by one, and $|S|=2d-1$.
Recall that an antimatching $A$ of $G$ is a set of edges such that two edges are at most at distance 2, and that the distance between two edges is defined as the distance between corresponding vertices in $L(G)$ (the Line graph of $G$).
As all edges from $S$ are connected to $e_{uv}$, then the maximum distance between edges of $S$ is 2.
Therefore $S$ is an antimatching of size $2d-1$.
I think that's all to proove. (I never studied antimatching before, I might be missing something).
Note An antimatching can also be defined (equivalently) as a subgraph with no induced matching of size greater than 1. This is also clearly the case for $S$ :
Suppose there exist an induced matching of size 2 in $S$. Then it must contains one edge connected to $u$ and one connected to $v$. But then in order to be induced we would need to include $e_{uv}$, and would not be a matching. Hence a contradiction.
Therefore the only induced matching of $S$ have size 1.
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
$endgroup$
Let $G$ be a $d$-regular bipartite graph. And let $e_{uv}$ be an edge of $G$.
Let $S$ the set of $e_{uv}$ and all its adjacent edges. Then the size of $S$ is $2d-1$ : They are $d$ edges connected at the vertex $u$, and $d$ connected at vertex $v$. As we double count $e_{uv}$, we reduce the count by one, and $|S|=2d-1$.
Recall that an antimatching $A$ of $G$ is a set of edges such that two edges are at most at distance 2, and that the distance between two edges is defined as the distance between corresponding vertices in $L(G)$ (the Line graph of $G$).
As all edges from $S$ are connected to $e_{uv}$, then the maximum distance between edges of $S$ is 2.
Therefore $S$ is an antimatching of size $2d-1$.
I think that's all to proove. (I never studied antimatching before, I might be missing something).
Note An antimatching can also be defined (equivalently) as a subgraph with no induced matching of size greater than 1. This is also clearly the case for $S$ :
Suppose there exist an induced matching of size 2 in $S$. Then it must contains one edge connected to $u$ and one connected to $v$. But then in order to be induced we would need to include $e_{uv}$, and would not be a matching. Hence a contradiction.
Therefore the only induced matching of $S$ have size 1.
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
edited Jan 18 at 15:26
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
answered Jan 18 at 15:20
Thomas LesgourguesThomas Lesgourgues
927117
927117
add a comment |
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%2f3078336%2fantimatching-in-revolving-door-graph%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
