New results from an algorithm for counting posets (Q1177709)

The authors describe an algorithm used to generate a computer enumeration of the number of unlabeled posets on \(n\) elements and \(r\) relations, for \(0\leq n\leq 11\) and \(0\leq r\leq{n-1 \choose 2}\). They report on a new technique for computing based on the partial orders ordered by containment. They verified results of Möhring for \(n\leq 9\), claim additional 35 posets for \(n=10\) and give results for \(n=11\). They also extend the work of Avann from \(n=5\) to \(n=9\) in counting the number of natural partial orders. Further they discovered and verified the existence of some interesting recurrences that hold for the number of partial orders and for the number of natural partial orders.