Inducibility of 4-vertex tournaments

Abstract

We determine the inducibility of all tournaments with at most $4$ vertices together with the extremal constructions. The $4$-vertex tournament containing an oriented $C_3$ and one source vertex has a particularly interesting extremal construction. It is an unbalanced blow-up of an edge, where the sink vertex is replaced by a quasi-random tournament and the source vertex is iteratively replaced by a copy of the construction itself.

minor corrections

References in corpus (5)

• Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
• A bound on the inducibility of cycles
• Inducibility of directed paths
• The inducibility of oriented stars
• On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices