Inducibility of 4-vertex tournaments
arXiv:2103.07047
Abstract
We determine the inducibility of all tournaments with at most vertices together with the extremal constructions. The -vertex tournament containing an oriented 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.
arXiv commentminor corrections
References in corpus (6)
- Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
- A Note on the Inducibility of 4-vertex Graphs
- 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