Let T be a tournament of order n 10. Suppose that T contains two vertices u and v such
Chapter 15, Problem 16(choose chapter or problem)
Let T be a tournament of order n 10. Suppose that T contains two vertices u and v such that when the directed edge joining u and v is removed, the resulting digraph D does not contain a directed u v path or a directed v u path. Show that odD u = odD v.
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