If the edges of a complete graph are each given an orientation, the resulting directed graph is called a tournament.

can be decomposed into trees such that has vertices. Ringel's conjecture asks if the complete graph can be decomposed into copies of any tree with edges. This is known to be true for sufficiently large .

The number of all distinct paths

1.Previous
3.Next