Reply
Tue 15 Nov, 2005 12:14 am
Hi all! How to do this:
Prove that a tournament is irreducible if and only if it is strongly connected
Any help will be greatly appreciated. Thanks!
May be this will help...
A tournament, T, is irreducible if it is impossible to split the set of vertices of T into two disjoint sets V_1 and V_2 so that each arc joining a vertex of V_1 and a vertex of V_2 is directed from V_1 to V_2.
No one has even the slightest clue about this? Just wondering...
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace