In a previous work [5], we developed the shifted Turán sieve method on a bipartite graph and applied it to problems on cycles in tournaments. More precisely, we obtained upper bounds for the number of tournaments which ...