OurBigBook
About
$
Donate
Sign in
Sign up
Regular tournament
(
d
+
(
v
)
=
d
−
(
v
)
=
(
N
−
1
)
/2
)
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Foundations of mathematics
Graph theory
Directed graph
Tournament (graph theory)
2026-10-14
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
regular
tournament
has equal
outdegree
and
indegree
at every
vertex
. On
2
k
+
1
vertices
, label by
residues
modulo
2
k
+
1
and direct
i
→
j
when
j
−
i
∈
{
1
,
…
,
k
}
. This gives an explicit regular tournament. It contains no outward-oriented
star
with more than
k
leaves
.
Ancestors
(7)
Tournament (graph theory)
Directed graph
Graph theory
Foundations of mathematics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2005
/
iii
/
Paper 11
/
3
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version