New results from an algorithm for counting posets

DOI10.1007/BF00383201zbMath0738.06002MaRDI QIDQ1177709

Joseph C. Culberson, Gregory J. E. Rawlins

Publication date: 26 June 1992

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

algorithmrecurrencescomputer enumeration of partial ordersnumber of natural partial ordersnumber of partial ordersposet of posets

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Enumeration in graph theory (05C30) Software, source code, etc. for problems pertaining to ordered structures (06-04)

Related Items (7)

Partition coefficients of acyclic graphs ⋮ Height counting of unlabeled interval and \(N\)-free posets. ⋮ Counting finite posets and topologies ⋮ The number of partially ordered sets with more points than incomparable pairs ⋮ 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 ⋮ The number of nonisomorphic posets having 12 elements

Cites Work

• Unnamed Item
• Unnamed Item
• Producing posets
• On the cardinalities of finite topologies and the number of antichains in partially ordered sets
• The number of partially ordered sets with more points than incomparable pairs
• The lattice of natural partial orders
• A Machine Representation of Finite T ₀ Topologies
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
• Asymptotic Enumeration of Partial Orders on a Finite Set
• Orderly algorithms for generating restricted classes of graphs
• On the computer enumeration of finite topologies
• Note on Finite Topological Spaces

This page was built for publication: New results from an algorithm for counting posets