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 $frac{3}{4}{n choose 5}$, the expected number 5-cycles in a random tournament ($p=frac{1}{2}$), 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.
We consider Containment: a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop), and the cops win by co
ntaining the robber---that is, by occupying all $deg(v)$ of the edges incident with a vertex $v$ while the robber is at $v$. We develop bounds that relate the minimal number of cops, $xi(G)$, required to contain a robber to the well-known cop-number $c(G)$ in the original game: in particular, $c(G) {le} xi(G) {le} gamma(G) Delta(G)$. We note that $xi(G) {geq} delta(G)$ for all graphs $G$, and analyze several families of graphs in which equality holds, as well as several in which the inequality is strict. We also give examples of graphs which require an unbounded number of cops in order to contain a robber, and note that there exist cubic graphs with $xi(G) geq Omega(n^{1/6})$.
