2 search results - page 1 / 1 » Decomposing oriented graphs into transitive tournaments |
88
Voted
DM
2006
14 years 10 months ago
2006
For an oriented graph G with n vertices, let f(G) denote the minimum number of transitive subtournaments that decompose G. We prove several results on f(G). In particular, if G is...
COMBINATORICS
2006
14 years 10 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...