Counting pattern-free set partitions II: Noncrossing and other hypergraphs

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-25

  Klazar, Martin ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346172929     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1512     Document Type: Article

References (25)

1. N. Alon and E. Friedgut, On the number of permutations avoiding a given pattern, J. Comb. Theory, Ser. A 89 (2000), 133-140.
2. M. Bóna, The solution of a conjecture of Stanley and Wilf for all layered patterns, J. Comb. Theory, Ser. A 85 (1999), 96-104.
3. A. Burstein, Enumeration of words with forbidden patterns, Ph.D. thesis, University of Pennsylvania, 1998.
4. C. Domb and A. Barrett, Enumeration of ladder graphs, Discrete Math. 9 (1974), 341-358.
5. P. Flajolet and M. Noy, Analytic combinatorics of non-crossing configurations, Discrete Math. 204 (1999), 203-229.
6. Z. Füredi, The maximum number of unit distances in a convex n-gon, J. Comb. Theory, Ser. A 55 (1990), 316-320.
7. Z. Füredi and P. Hajnal, Davenport-Schinzel theory of matrices, Discrete Math. 103 (1992), 233-251.
8. D. Gouyou-Beauchamps and G. Viennot, Equivalence of the two-dimensional directed animal problem to a one-dimensional path problem, Adv. Appl. Math. 9 (1988), 334-357.
9. M. Klazar, A general upper bound in extremal theory of sequences, Commentat. Math. Univ. Carol. 33 (1992), 737-746.
10. M. Klazar, On abab-free and abba-free set partitions, Eur. J. Comb. 17 (1996), 53-68.
11. M. Klazar, Counting pattern-free set partitions I: A generalization of Stirling numbers of the second kind, Eur. J. Comb. 21 (2000), 367-378.
12. th International Conference, FPSAC'00, Moscow, Russia, June 2000, Proceedings, Springer, Berlin, 2000.
13. M. Klazar and P. Valtr, Generalized Davenport-Schinzel sequences, Combinatorica 14 (1994), 463-476.
14. G. Kreweras, Sur les partitions non croisées d'un cycle, Discrete Math. 1 (1972), 333-350.
15. J. Němeček, personal communication, 2000.
16. A. M. Odlyzko, Asymptotic enumeration methods, 1063-1232. In: R. L. Graham, M. Grötschel and L. Lovász (Eds.), Handbook of Combinatorics, Vol. 2, North-Holland, Amsterdam, 1995.
17. P. Podbrdský, personal communication, 2000.
18. D. G. Rogers, The enumeration of a family of ladder graphs. Part II: Schroeder and superconnective relations, Q. J. Math., Oxf. II 31 (1980), 491-506.
19. L. W. Shapiro, Directed animals and Motzkin paths, manuscript 1999.
20. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, Cambridge, UK, 1995.
21. R. Simion, Noncrossing partitions, Discrete Math. 217 (2000), 367-409.
22. R. Simion and F. W. Schmidt, Restricted permutations, Eur. J. Comb. 6 (1985), 383-406.
23. R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, UK, 1999.
24. P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete Comput. Geom. 19 (1998), 461-469.
25. P. Valtr, Generalizations of Davenport-Schinzel sequences, 349-389. In: R. L. Graham, J. Kratochvíl, J. Nešetřil, F. S. Roberts (Eds.), Contemporary Trends in Discrete Mathematics, American Mathematical Society, Providence, RI, 1999.