Stanley-Wilf limits are typically exponential

P. A. MacMahon, Combinatory Analysis, Cambridge University Press, 1915

1915

Earlier work this paper cites.

D. Knuth, The art of computer programming, vol. 1: fundamental algorithms

1968

Earlier work this paper cites.

A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. Math

1981

Earlier work this paper cites.

J. West, Permutations with forbidden subsequences and stack-sortable permutations, Ph.D. Thesis, M.I.T. 1990

1990

Earlier work this paper cites.

Z. Füredi and P. Hajnal, Davenport-Schinzel theory of matrices, Discrete Math

1992

Earlier work this paper cites.

R. Arratia, On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern, Electron. J. Combin

1999

Earlier work this paper cites.

N. Alon and E. Friedgut, On the number of permutations avoiding a given pattern, J. Combin. Theory Ser. A

2000

Earlier work this paper cites.

M. Klazar, The Füredi-Hajnal conjecture implies the Stanley-Wilf conjecture, in: D. Krob, A.A. Mikhalev, A.V. Mikhalev (Eds.), Formal Power Series and Algebraic Combinatorics, Springer, Berlin, 2000, pp. 250–255

2000

Earlier work this paper cites.

E. G. Coffman, G. S. Lueker, J. Spencer, and P. Winkler, Packing random rectangles, Probab. Theory Related Fields

2001

Earlier work this paper cites.

S. Janson, D. Randall, and J. Spencer, Random dyadic tilings of the unit square, Random Structures Algorithms

2002

Cited alongside, same era.

T. Kaiser, M. Klazar, On growth rates of closed permutation classes, Electron. J. Combin

2002

Cited alongside, same era.

A. Marcus and G. Tardos, Excluded permutation matrices and the Stanley-Wilf conjecture. J. Combin. Theory Ser. A

2004

Cited alongside, same era.

N. Robertson and P. D. Seymour, Graph Minors. XX. Wagner’s conjecture, J. Combin. Theory Ser. B

2004

Cited alongside, same era.

M. Bóna, The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns, J. Combin. Theory Ser. A

2005

Cited alongside, same era.

R. P. Stanley, Longest alternating subsequences of permutations, Michigan Math. J

2008

Later among the works it cites.

J. Cibulka, On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture, J. Combin. Theory Ser. A

2009

Later among the works it cites.

S. Kitaev, Patterns in Permutations and Words

2011

Later among the works it cites.

J. Novak, An asymptotic version of a theorem of Knuth, Adv. in Appl. Math

2011

Later among the works it cites.

M. Bóna, Combinatorics of Permutations

2012

Later among the works it cites.

A. Claesson, V. Jelínek, and E. Steingrímsson, Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns, J. Combin. Theory Ser. A

2012

Later among the works it cites.