Skip to main content
MathOverflow

Return to Question

Correction of number of tournaments with ties with 3 nodes.
Source Link
Bernardo Recamán Santos
Bernardo Recamán Santos
  • 3.7k
  • 15
  • 39

An improper tournament, or tournament with ties, is a graph in which every pair of nodes is connected by a single uniquely directed edge or by a single undirected edge. There are 1, 2, and 67 improper tournaments of orders 1, 2, and 3, respectively. How many are there of order 4? Of order n?

An improper tournament, or tournament with ties, is a graph in which every pair of nodes is connected by a single uniquely directed edge or by a single undirected edge. There are 1, 2, and 6 improper tournaments of orders 1, 2, and 3, respectively. How many are there of order 4? Of order n?

An improper tournament, or tournament with ties, is a graph in which every pair of nodes is connected by a single uniquely directed edge or by a single undirected edge. There are 1, 2, and 7 improper tournaments of orders 1, 2, and 3, respectively. How many are there of order 4? Of order n?

Source Link
Bernardo Recamán Santos
Bernardo Recamán Santos
  • 3.7k
  • 15
  • 39

Counting tournaments with ties

An improper tournament, or tournament with ties, is a graph in which every pair of nodes is connected by a single uniquely directed edge or by a single undirected edge. There are 1, 2, and 6 improper tournaments of orders 1, 2, and 3, respectively. How many are there of order 4? Of order n?