Universal graphs and universal permutations

Atminas, Aistis and Kitaev, Sergey and Lozin, Vadim and Valyuzhenich, Alexander (2013) Universal graphs and universal permutations. Discrete Mathematics, Algorithms and Applications, 5 (4). ISSN 1793-8317 (https://doi.org/10.1142/S1793830913500389)

Full text not available in this repository.Request a copy

Abstract

Let X be a family of graphs and Xn the set of n-vertex graphs in X. A graph U(n) containing all graphs from Xn as induced subgraphs is called n-universal for X. Moreover, we say that U(n) is a propern-universal graph for X if it belongs to X. In the present paper, we construct a proper n-universal graph for the class of split permutation graphs. Our solution includes two ingredients: a proper universal 321-avoiding permutation and a bijection between 321-avoiding permutations and symmetric split permutation graphs. The n-universal split permutation graph constructed in this paper has 4n3 vertices, which means that this construction is order-optimal.

ORCID iDs

Atminas, Aistis, Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647, Lozin, Vadim and Valyuzhenich, Alexander;
CORE (COnnecting REpositories)