Pages that link to "Item:Q1177709"
From MaRDI portal
The following pages link to New results from an algorithm for counting posets (Q1177709):
Displaying 15 items.
- On recurrence relation in the problem of enumeration of finite posets (Q515207) (← links)
- Posets on up to 16 points (Q698446) (← links)
- Counting finite posets and topologies (Q1183945) (← links)
- The number of partially ordered sets with more points than incomparable pairs (Q1199473) (← links)
- The number of orders with thirteen elements (Q1207714) (← links)
- The number of nonisomorphic posets having 12 elements (Q1314405) (← links)
- On the poset of all posets on \(n\) elements (Q1326745) (← links)
- Height counting of unlabeled interval and \(N\)-free posets. (Q1420594) (← links)
- On recursion relations in the problem of enumeration of posets (Q2306042) (← links)
- A framework for the systematic determination of the posets on \(n\) points with at least \(\tau \cdot 2^n\) downsets (Q2314416) (← links)
- On numerical counting of prime, UPO, and the general type of posets according to heights (Q2716680) (← links)
- (Q2932529) (← links)
- Petits posets: Dénombrement, représentabilité par cercles et ``compenseurs''. (Small posets: Enumeration, circle orders, and ``compensors'') (Q3983165) (← links)
- (Q4390670) (← links)
- (Q4454379) (← links)
