On the maximum density of fixed strongly connected subtournaments
classification
🧮 math.CO
cs.DM
keywords
tournamentsdensityconnectedfixedmaximumstronglysubtournamentsasymptotically
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.