2021/03/12 by Burke, Dalton, Lidický, Bernard, Pfender, Florian +1 · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2103.07047
We determine the inducibility of all tournaments with at most 4 vertices together with the extremal constructions. The 4-vertex tournament containing an oriented C3 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.