Given a tournament graph like this :
How do you find out how many rankings there are systematically?
Help / explanation would really be appreciated.
Given a tournament graph like this : How do you find out how many
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Given a tournament graph like this :
How do you find out how many rankings there are systematically?
Help / explanation would really be appreciated.
Did you mean this graph specifically, in which every node has two “in” edges and two “out” edges? That is, a graph in which there’s no reason to prefer any specific node, and any arrangement of five letters is equally good? That’s just asking how many different ways you can arrange five letters.
As an aside, the graph reminds me very much of the win-lose graph of Rock, Paper, Scissors, Spock, Lizard. In fact, you get this graph if you identify
xwith paper,ywith lizard,vwith scissors,wwith Spock, anduwith rock. There is an arrow fromatobifadefeatsb.