On the Number of 5‐Cycles in a Tournament

DOI10.1002/jgt.22130zbMath1375.05118arXiv1410.6828OpenAlexW2963441217MaRDI QIDQ4596320

John Mackey, Natasha Komarov

Publication date: 1 December 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.6828

zbMATH Keywords

tournamentsextremal combinatorics5-cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex ⋮ On the number of 7-cycles in regular \(n\)-tournaments ⋮ Minimizing cycles in tournaments and normalized \(q\)-norms ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Cycles of a given length in tournaments

This page was built for publication: On the Number of 5‐Cycles in a Tournament