On packing densities of permutations

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-20

  Albert, M H ^a   Atkinson, M D ^a   Handley, C C ^a   Holton, D A ^a   Stromquist, W ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b NONE

Author keywords

Layered permutations; Packing density; Pattern containment; Permutations

Indexed keywords

EID: 3042512424     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1622     Document Type: Article

References (8)

1. M. Bóna: Exact enumeration of 1342-avoiding permutations, A close link with labeled trees and planar maps, Journal of Combinatorial Theory, Series A, 80 (1997) 257-272.
2. S. A. Burr, V. Rosta: On the Ramsey multiplicities pf graphs - Problems and recent results, J. Graph Theory 4 (1980), 347-361.
3. A. W. Goodman: On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959) 778-783.
4. A. Price, Packing densities of layered patterns, Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, 1997.
5. R. Simion, F. W. Schmidt: Restricted permutations, Europ. J. Combinatorics 6 (1985), 383-406.
6. Z. E. Stankova: Classification of forbidden subsequences of length 4, European J. Combin. 17 (1996), no. 5, 501-517.
7. W. Stromquist: Packing layered posets into posets, Unpublished typescript, 1993.
8. J. West: Generating trees and the Catalan and Schröder numbers, Discrete Math. 146 (1995), 247-262.