Sciweavers

100
Voted
DM
2006
86views more  DM 2006»
15 years 23 days ago
Decomposing oriented graphs into transitive tournaments
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...
Raphael Yuster