Mixing
Strongly regular tournament
$begingroup$
A digraph on $n$ vertices is called a tournament if there is a exactly one directed edge between any two distinct vertices. A vertex $v$ dominates a vertex $w$ if there is an edge from $v$ to $w$.
Let $dm(v)$ be the set of vertices that are dominated by $v$, and $dm(v,w)$ be the set of vertices that are dominated by both $v$ and $w$. Then the digraph is called a regular tournament if there is a positive integer $m$ such that $dm(v)=m$ for all $v$, and strongly regular if there are positive integers $m_1$ and $m_2$ such that $dm(v,w)=m_1$ for all $v neq w$ and $dm(v)=m_2$ for all $v$.
I am asked to show that if a tournament is regular that $n$ is odd and that if it is strongly regular that $4 mid n-3$. I am allowed to use the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$.
The first part is not too hard: if $G$ is a tournament and we remove a vertex $v$ from $G$ then the in-degree of $v$ is equal to the out-degree so $G/v$ must have an even number of vertices.
I have not been able to solve the second part of the question.
graph-theory directed-graphs
edited Jan 22 at 14:51
darij grinberg
11.1k33167
asked Jul 6 '14 at 16:55
cevicheceviche
111
$endgroup$
add a comment |
$begingroup$
A digraph on $n$ vertices is called a tournament if there is a exactly one directed edge between any two distinct vertices. A vertex $v$ dominates a vertex $w$ if there is an edge from $v$ to $w$.
Let $dm(v)$ be the set of vertices that are dominated by $v$, and $dm(v,w)$ be the set of vertices that are dominated by both $v$ and $w$. Then the digraph is called a regular tournament if there is a positive integer $m$ such that $dm(v)=m$ for all $v$, and strongly regular if there are positive integers $m_1$ and $m_2$ such that $dm(v,w)=m_1$ for all $v neq w$ and $dm(v)=m_2$ for all $v$.
I am asked to show that if a tournament is regular that $n$ is odd and that if it is strongly regular that $4 mid n-3$. I am allowed to use the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$.
The first part is not too hard: if $G$ is a tournament and we remove a vertex $v$ from $G$ then the in-degree of $v$ is equal to the out-degree so $G/v$ must have an even number of vertices.
I have not been able to solve the second part of the question.
graph-theory directed-graphs
edited Jan 22 at 14:51
darij grinberg
11.1k33167
asked Jul 6 '14 at 16:55
cevicheceviche
111
$endgroup$
$begingroup$
"the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$" Fact??? This is false for a $4$-vertex digraph that consists of a $3$-cycle and a further vertex that has an edge into the cycle. It is true for tournaments, but for a rather nontrivial reason (indeed, in any digraph, the sum of all indegrees equals the sum of all outdegrees; but in a tournament, it is also true that the sum of the squares of all indegrees equals the sum of the squares of all outdegrees, and thus we are in the equality case of the Cauchy-Schwarz inequality).
$endgroup$
– darij grinberg
Jan 22 at 14:51
add a comment |
$begingroup$
A digraph on $n$ vertices is called a tournament if there is a exactly one directed edge between any two distinct vertices. A vertex $v$ dominates a vertex $w$ if there is an edge from $v$ to $w$.
Let $dm(v)$ be the set of vertices that are dominated by $v$, and $dm(v,w)$ be the set of vertices that are dominated by both $v$ and $w$. Then the digraph is called a regular tournament if there is a positive integer $m$ such that $dm(v)=m$ for all $v$, and strongly regular if there are positive integers $m_1$ and $m_2$ such that $dm(v,w)=m_1$ for all $v neq w$ and $dm(v)=m_2$ for all $v$.
I am asked to show that if a tournament is regular that $n$ is odd and that if it is strongly regular that $4 mid n-3$. I am allowed to use the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$.
The first part is not too hard: if $G$ is a tournament and we remove a vertex $v$ from $G$ then the in-degree of $v$ is equal to the out-degree so $G/v$ must have an even number of vertices.
I have not been able to solve the second part of the question.
graph-theory directed-graphs
edited Jan 22 at 14:51
darij grinberg
11.1k33167
asked Jul 6 '14 at 16:55
cevicheceviche
111
$endgroup$
A digraph on $n$ vertices is called a tournament if there is a exactly one directed edge between any two distinct vertices. A vertex $v$ dominates a vertex $w$ if there is an edge from $v$ to $w$.
Let $dm(v)$ be the set of vertices that are dominated by $v$, and $dm(v,w)$ be the set of vertices that are dominated by both $v$ and $w$. Then the digraph is called a regular tournament if there is a positive integer $m$ such that $dm(v)=m$ for all $v$, and strongly regular if there are positive integers $m_1$ and $m_2$ such that $dm(v,w)=m_1$ for all $v neq w$ and $dm(v)=m_2$ for all $v$.
I am asked to show that if a tournament is regular that $n$ is odd and that if it is strongly regular that $4 mid n-3$. I am allowed to use the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$.
The first part is not too hard: if $G$ is a tournament and we remove a vertex $v$ from $G$ then the in-degree of $v$ is equal to the out-degree so $G/v$ must have an even number of vertices.
I have not been able to solve the second part of the question.
graph-theory directed-graphs
graph-theory directed-graphs
edited Jan 22 at 14:51
darij grinberg
11.1k33167
asked Jul 6 '14 at 16:55
cevicheceviche
111
edited Jan 22 at 14:51
darij grinberg
11.1k33167
asked Jul 6 '14 at 16:55
cevicheceviche
111
edited Jan 22 at 14:51
darij grinberg
11.1k33167
edited Jan 22 at 14:51
darij grinberg
11.1k33167
edited Jan 22 at 14:51
darij grinberg
11.1k33167
11.1k33167
asked Jul 6 '14 at 16:55
cevicheceviche
111
asked Jul 6 '14 at 16:55
cevicheceviche
111
asked Jul 6 '14 at 16:55
cevicheceviche
111
111
$begingroup$
"the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$" Fact??? This is false for a $4$-vertex digraph that consists of a $3$-cycle and a further vertex that has an edge into the cycle. It is true for tournaments, but for a rather nontrivial reason (indeed, in any digraph, the sum of all indegrees equals the sum of all outdegrees; but in a tournament, it is also true that the sum of the squares of all indegrees equals the sum of the squares of all outdegrees, and thus we are in the equality case of the Cauchy-Schwarz inequality).
$endgroup$
– darij grinberg
Jan 22 at 14:51
add a comment |
$begingroup$
"the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$" Fact??? This is false for a $4$-vertex digraph that consists of a $3$-cycle and a further vertex that has an edge into the cycle. It is true for tournaments, but for a rather nontrivial reason (indeed, in any digraph, the sum of all indegrees equals the sum of all outdegrees; but in a tournament, it is also true that the sum of the squares of all indegrees equals the sum of the squares of all outdegrees, and thus we are in the equality case of the Cauchy-Schwarz inequality).
$endgroup$
– darij grinberg
Jan 22 at 14:51
$begingroup$
"the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$" Fact??? This is false for a $4$-vertex digraph that consists of a $3$-cycle and a further vertex that has an edge into the cycle. It is true for tournaments, but for a rather nontrivial reason (indeed, in any digraph, the sum of all indegrees equals the sum of all outdegrees; but in a tournament, it is also true that the sum of the squares of all indegrees equals the sum of the squares of all outdegrees, and thus we are in the equality case of the Cauchy-Schwarz inequality).
$endgroup$
– darij grinberg
Jan 22 at 14:51
$begingroup$
"the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$" Fact??? This is false for a $4$-vertex digraph that consists of a $3$-cycle and a further vertex that has an edge into the cycle. It is true for tournaments, but for a rather nontrivial reason (indeed, in any digraph, the sum of all indegrees equals the sum of all outdegrees; but in a tournament, it is also true that the sum of the squares of all indegrees equals the sum of the squares of all outdegrees, and thus we are in the equality case of the Cauchy-Schwarz inequality).
$endgroup$
– darij grinberg
Jan 22 at 14:51
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Late answer, but it might be useful to someone.
The sum of the out-degrees of all vertices is $n(n-1)/2$ (since a tournament on $n$ vertices has exactly $n(n-1)/2$ edges), so $m_2 = (n-1)/2$.
Now let $A$ be the set of couples of distinct edges directed to a same vertex.
$A = {(u,w),(v,w) in E^2, u neq v}$
For one vertex $u$, we can consider the set of the couples of edges that come from two different $v$ and $w$ to $u$. As the in-degree of $v$ is $m_2$ (since, as you said, for each vertex $v$, the in-degree is equal to the out-degree), this set has $m_2(m_2 - 1)/2$ elements.
Taking all those sets for every vertex in our graph gives a partition of $A$, thus $A$ has $ncdot m_2(m_2 - 1)/2$ elements.
An other partition of $A$ is given by the sets $dm(v,w)$ you defined for every couple of vertices. So the number of elements of $A$ is equal to $n(n-1)/2 cdot m_1$.
We conclude that $ncdot m_2(m_2 - 1)/2 = n(n-1)/2 cdot m_1$ which gives $n = 4m_1 + 3$.
edited Jan 22 at 14:38
darij grinberg
11.1k33167
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
$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%2f858110%2fstrongly-regular-tournament%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$
Late answer, but it might be useful to someone.
The sum of the out-degrees of all vertices is $n(n-1)/2$ (since a tournament on $n$ vertices has exactly $n(n-1)/2$ edges), so $m_2 = (n-1)/2$.
Now let $A$ be the set of couples of distinct edges directed to a same vertex.
$A = {(u,w),(v,w) in E^2, u neq v}$
For one vertex $u$, we can consider the set of the couples of edges that come from two different $v$ and $w$ to $u$. As the in-degree of $v$ is $m_2$ (since, as you said, for each vertex $v$, the in-degree is equal to the out-degree), this set has $m_2(m_2 - 1)/2$ elements.
Taking all those sets for every vertex in our graph gives a partition of $A$, thus $A$ has $ncdot m_2(m_2 - 1)/2$ elements.
An other partition of $A$ is given by the sets $dm(v,w)$ you defined for every couple of vertices. So the number of elements of $A$ is equal to $n(n-1)/2 cdot m_1$.
We conclude that $ncdot m_2(m_2 - 1)/2 = n(n-1)/2 cdot m_1$ which gives $n = 4m_1 + 3$.
edited Jan 22 at 14:38
darij grinberg
11.1k33167
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
$endgroup$
add a comment |
$begingroup$
Late answer, but it might be useful to someone.
The sum of the out-degrees of all vertices is $n(n-1)/2$ (since a tournament on $n$ vertices has exactly $n(n-1)/2$ edges), so $m_2 = (n-1)/2$.
Now let $A$ be the set of couples of distinct edges directed to a same vertex.
$A = {(u,w),(v,w) in E^2, u neq v}$
For one vertex $u$, we can consider the set of the couples of edges that come from two different $v$ and $w$ to $u$. As the in-degree of $v$ is $m_2$ (since, as you said, for each vertex $v$, the in-degree is equal to the out-degree), this set has $m_2(m_2 - 1)/2$ elements.
Taking all those sets for every vertex in our graph gives a partition of $A$, thus $A$ has $ncdot m_2(m_2 - 1)/2$ elements.
An other partition of $A$ is given by the sets $dm(v,w)$ you defined for every couple of vertices. So the number of elements of $A$ is equal to $n(n-1)/2 cdot m_1$.
We conclude that $ncdot m_2(m_2 - 1)/2 = n(n-1)/2 cdot m_1$ which gives $n = 4m_1 + 3$.
edited Jan 22 at 14:38
darij grinberg
11.1k33167
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
$endgroup$
add a comment |
$begingroup$
Late answer, but it might be useful to someone.
The sum of the out-degrees of all vertices is $n(n-1)/2$ (since a tournament on $n$ vertices has exactly $n(n-1)/2$ edges), so $m_2 = (n-1)/2$.
Now let $A$ be the set of couples of distinct edges directed to a same vertex.
$A = {(u,w),(v,w) in E^2, u neq v}$
For one vertex $u$, we can consider the set of the couples of edges that come from two different $v$ and $w$ to $u$. As the in-degree of $v$ is $m_2$ (since, as you said, for each vertex $v$, the in-degree is equal to the out-degree), this set has $m_2(m_2 - 1)/2$ elements.
Taking all those sets for every vertex in our graph gives a partition of $A$, thus $A$ has $ncdot m_2(m_2 - 1)/2$ elements.
An other partition of $A$ is given by the sets $dm(v,w)$ you defined for every couple of vertices. So the number of elements of $A$ is equal to $n(n-1)/2 cdot m_1$.
We conclude that $ncdot m_2(m_2 - 1)/2 = n(n-1)/2 cdot m_1$ which gives $n = 4m_1 + 3$.
edited Jan 22 at 14:38
darij grinberg
11.1k33167
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
$endgroup$
Late answer, but it might be useful to someone.
The sum of the out-degrees of all vertices is $n(n-1)/2$ (since a tournament on $n$ vertices has exactly $n(n-1)/2$ edges), so $m_2 = (n-1)/2$.
Now let $A$ be the set of couples of distinct edges directed to a same vertex.
$A = {(u,w),(v,w) in E^2, u neq v}$
For one vertex $u$, we can consider the set of the couples of edges that come from two different $v$ and $w$ to $u$. As the in-degree of $v$ is $m_2$ (since, as you said, for each vertex $v$, the in-degree is equal to the out-degree), this set has $m_2(m_2 - 1)/2$ elements.
Taking all those sets for every vertex in our graph gives a partition of $A$, thus $A$ has $ncdot m_2(m_2 - 1)/2$ elements.
An other partition of $A$ is given by the sets $dm(v,w)$ you defined for every couple of vertices. So the number of elements of $A$ is equal to $n(n-1)/2 cdot m_1$.
We conclude that $ncdot m_2(m_2 - 1)/2 = n(n-1)/2 cdot m_1$ which gives $n = 4m_1 + 3$.
edited Jan 22 at 14:38
darij grinberg
11.1k33167
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
edited Jan 22 at 14:38
darij grinberg
11.1k33167
edited Jan 22 at 14:38
darij grinberg
11.1k33167
edited Jan 22 at 14:38
darij grinberg
11.1k33167
11.1k33167
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
answered Sep 8 '16 at 19:09
KevlarKevlar
1464
1464
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%2f858110%2fstrongly-regular-tournament%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
$begingroup$
"the fact that in a regular digraph, for every vertex $v$ the in-degree of $v$ is equal to the out-degree of $v$" Fact??? This is false for a $4$-vertex digraph that consists of a $3$-cycle and a further vertex that has an edge into the cycle. It is true for tournaments, but for a rather nontrivial reason (indeed, in any digraph, the sum of all indegrees equals the sum of all outdegrees; but in a tournament, it is also true that the sum of the squares of all indegrees equals the sum of the squares of all outdegrees, and thus we are in the equality case of the Cauchy-Schwarz inequality).
$endgroup$
– darij grinberg
Jan 22 at 14:51