N-Unavoidable graph

[math]\displaystyle{ n }[/math]-Unavoidable graph --- [math]\displaystyle{ n }[/math]-неизбежный граф.

A digraph is said to be [math]\displaystyle{ n }[/math]-unavoidable, if every tournament of order [math]\displaystyle{ n }[/math] contains it as a subgraph.