Prove that an orientation of Kn is a transitive tournament if and only if it does not have any d

Name: Problem 3, Chapter 13: Introductory Combinatorics
Uploaded: 2019-09-11T03:43:31-08:00
Duration: 1 min 27 s
Channel: Wen Zheng
Description: Prove that an orientation of Kn is a transitive tournament if and only if it does not have any directed cycles of length 3 .

Question

Wen Zheng · Accepted Answer

step 1 that k is greater than 2 g h denote two graphs osmorphic graphs and f is a map from g to h and d

Please give Ace some feedback