On the maximum density of fixed strongly connected subtournaments
Abstract
We study the density of fixed strongly connected subtournaments on 5 vertices in large tournaments. We determine the maximum density asymptotically for five tournaments as well as unique extremal sequences for each tournament. As a byproduct we also characterize tournaments that are recursive blow-ups of a 3-cycle as tournaments that avoid three specific tournaments of size 5.
- Publication:
-
arXiv e-prints
- Pub Date:
- May 2015
- DOI:
- 10.48550/arXiv.1505.05200
- arXiv:
- arXiv:1505.05200
- Bibcode:
- 2015arXiv150505200C
- Keywords:
-
- Mathematics - Combinatorics;
- Computer Science - Discrete Mathematics