Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums

DOI10.2307/2040080zbMath0297.05009OpenAlexW4249024923MaRDI QIDQ4050603

Richard P. Stanley

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/2040080

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15)

Related Items (17)

Counting two-dimensional posets ⋮ On the Boolean dimension of spherical orders ⋮ On the probability of connectedness ⋮ The number of partial orders of fixed width ⋮ Asymptotic enumeration of two-dimensional posets ⋮ Poset loops ⋮ Asymptotic enumeration of N-free partial orders ⋮ Height counting of unlabeled interval and \(N\)-free posets. ⋮ Catalan pairs: a relational-theoretic approach to Catalan numbers ⋮ New results from an algorithm for counting posets ⋮ Counting finite posets and topologies ⋮ The number of partially ordered sets with more points than incomparable pairs ⋮ A countercyclical operad on shrubs ⋮ Series-parallel posets and the Tutte polynomial ⋮ Unnamed Item ⋮ Combinatorial properties of Catalan pairs ⋮ Forbidden induced partial orders

Cites Work

• Asymptotic Methods in Enumeration
• The Number of Finite Topologies
• Unnamed Item

This page was built for publication: Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums