Pattern avoiding permutations and independent sets in graphs
Combinatorics
2019-12-13 v3
Abstract
We introduce a new method for encoding permutations as weighted independent sets in a family of graphs we call cores. The encoding allows us to enumerate (1324, 2143)-, (1234, 1324, 2143)-, (1234, 1324, 1432, 3214)-avoiding permutations with respect to their number of "boundary points" and the size of the independent set in the graph they correspond to.
Cite
@article{arxiv.1512.08155,
title = {Pattern avoiding permutations and independent sets in graphs},
author = {Christian Bean and Murray Tannock and Henning Ulfarsson},
journal= {arXiv preprint arXiv:1512.08155},
year = {2019}
}
Comments
21 pages, 14 figures, 3 tables