Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind

This publication has 23 references indexed in Scilit:

• The Solution of a Conjecture of Stanley and Wilf for All Layered Patterns
  Journal of Combinatorial Theory, Series A, 1999
• Partitions with k Crossings
  The Ramanujan Journal, 1999
• On Geometric Graphs with No Two Edges in Convex Position
  Discrete & Computational Geometry, 1998
• Exact Enumeration of 1342-Avoiding Permutations: A Close Link with Labeled Trees and Planar Maps
  Journal of Combinatorial Theory, Series A, 1997
• Permutations avoiding certain patterns: The case of length 4 and some generalizations
  Discrete Mathematics, 1997
• On abab-free and abba-free Set Partitions
  European Journal of Combinatorics, 1996
• Symmetric functions and P-recursiveness
  Journal of Combinatorial Theory, Series A, 1990
• The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
  Discrete & Computational Geometry, 1990
• Ordered trees and non-crossing partitions
  Discrete Mathematics, 1986
• Sur les partitions non croisees d'un cycle
  Discrete Mathematics, 1972