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

algorithm; recurrences; computer enumeration of partial orders; number of natural partial orders; number of partial orders; poset of posets

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

06A07: Combinatorics of partially ordered sets

05C30: Enumeration in graph theory

06-04: Software, source code, etc. for problems pertaining to ordered structures

Related Items

Counting finite posets and topologies, The number of partially ordered sets with more points than incomparable pairs, The number of orders with thirteen elements, The number of nonisomorphic posets having 12 elements, Height counting of unlabeled interval and \(N\)-free posets., A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets

Cites Work

• 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
• Unnamed Item
• Unnamed Item