Universal graphs and universal permutations

Aistis Atminas, Sergey Kitaev, Vadim V. Lozin +1

Let $X$ be a family of graphs and $X_n$ the set of $n$-vertex graphs in $X$. A graph $U^{(n)}$ containing all graphs from $X_n$ as induced subgraphs is called $n$-universal for $X$…