What is the largest positive integer k such that for every tournament T with V (T ) =
Chapter 15, Problem 17(choose chapter or problem)
What is the largest positive integer k such that for every tournament T with V (T ) = {v1, v2, . . ., vn}, Pn i=1(od vi)k = Pn i=1(id vi)k?
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