Computer Science, asked by hyder5267, 1 year ago

Prove that a strongly connected tournament t on n vertices contains a directed cycle of length 3,4,5,....n

Answers

Answered by Padmanab
0
wait i know the answer but I am not sure with it
Similar questions