The number of partially ordered sets with more points than incomparable pairs

DOI10.1016/0012-365X(92)90131-XzbMath0761.06004WikidataQ127972335 ScholiaQ127972335MaRDI QIDQ1199473

Marcel Erné

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomialslinear extensionrecursion formulaunlabeled posetsunrelated pairs

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items (5)

The average number of linear extensions of a partial order ⋮ New results from an algorithm for counting posets ⋮ Counting finite posets and topologies ⋮ The number of orders with thirteen elements ⋮ A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets

Cites Work

• New results from an algorithm for counting posets
• The lattice of natural partial orders
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums

This page was built for publication: The number of partially ordered sets with more points than incomparable pairs