Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
A collection of permutation classes is exhibited whose growth rates form a perfect set, thereby refuting some conjectures of Balogh, Bollobás and Morris.
[1]Albert, M. H. (2007) On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation. Random Struct. Alg.31227–238.CrossRefGoogle Scholar
[2]
[2]Albert, M. H., Atkinson, M. D. and Ruškuc, N. (2003) Regular closed sets of permutations. Theoret. Comput. Sci.30685–100.CrossRefGoogle Scholar
[3]
[3]Balogh, J., Bollobás, B. and Morris, R. (2006) Hereditary properties of ordered graphs. In Topics in Discrete Mathematics, Vol. 26 of Algorithms Combin., Springer, Berlin, pp. 179–213.CrossRefGoogle Scholar
[6]Huczynska, S. and Vatter, V.Grid classes and the Fibonacci dichotomy for restricted permutations. Electron. J. Combin.13 #54 (electronic).Google Scholar
[7]
[7]Kaiser, T. and Klazar, M. (2002/03) On growth rates of closed permutation classes. Electron. J. Combin.9 #10 (electronic).Google Scholar
[8]
[8]Marcus, A. and Tardos, G. (2004) Excluded permutation matrices and the Stanley–Wilf conjecture. J. Combin. Theory Ser. A107153–160.CrossRefGoogle Scholar
[9]
[9]Vatter, V. Small permutation classes (preprint) arXiv:0712.4006v2 [Math.CO].Google Scholar