Prove or disprove: If T is a tournament of order n 4 that is not transitive, then T is
Chapter 15, Problem 13(choose chapter or problem)
Prove or disprove: If T is a tournament of order n 4 that is not transitive, then T is strong.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer