Show that a tournament can contain three vertices of outdegree 1 but can never contain
Chapter 15, Problem 10(choose chapter or problem)
Show that a tournament can contain three vertices of outdegree 1 but can never contain four vertices of outdegree 1.
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