论文标题
关于四个顶点上定向图的诱导性
On the inducibility of oriented graphs on four vertices
论文作者
论文摘要
我们考虑确定四个顶点上定向图的诱导性（最大可能的诱导拷贝渐近密度）的问题。我们为超过一半的图提供了精确的值，以及所有其余图形的下限和上限非常接近。发生某些图，极端构造的结构最大化其诱导拷贝的密度非常复杂且复杂。
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper bounds for all the remaining ones. It occurs that, for some graphs, the structure of extremal constructions maximizing density of its induced copies is very sophisticated and complex.
