Question: Let T = (V, E) be a tournament with v V of maximum out degree. If w V and w v, prove

Let T = (V, E) be a tournament with v ∈ V of maximum out degree. If w ∈ V and w ≠ v, prove that either (v, w) ∈ E or there is a vertex y in V where y ≠ v, w, and (v, y), (y, w) ∈ E. (Such a vertex v is called a king for the tournament.

Step by Step Solution

3.39 Rating (168 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Proof If not there exists a vertex x such that v x E ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (8187).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!