The number of partially ordered sets with more points than incomparable pairs (Q1199473): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The lattice of natural partial orders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New results from an algorithm for counting posets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums / rank | |||
Normal rank | |||
Latest revision as of 16:16, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of partially ordered sets with more points than incomparable pairs |
scientific article |
Statements
The number of partially ordered sets with more points than incomparable pairs (English)
0 references
16 January 1993
0 references
unlabeled posets
0 references
unrelated pairs
0 references
recursion formula
0 references
polynomials
0 references
linear extension
0 references
