On the number of 5-cycles in a tournament

From MaRDI portal
Publication:4596320




Abstract: We find an exact formula for the number of directed 5-cycles in a tournament in terms of its edge score sequence. We use this formula to find both upper and lower bounds on the number of 5-cycles in any n-tournament. In particular, we show that the maximum number of 5-cycles is asymptotically equal to frac34nchoose5, the expected number 5-cycles in a random tournament (p=frac12), with equality (up to order of magnitude) for almost all tournaments. Note that this means that almost all n-tournaments contain the maximum number of 5-cycles.









This page was built for publication: On the number of 5-cycles in a tournament

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596320)