Counting linear extensions of restricted posets (Q2215472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7284879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting linear extensions of restricted posets |
scientific article; zbMATH DE number 7284879 |
Statements
Counting linear extensions of restricted posets (English)
0 references
13 December 2020
0 references
Summary: We prove the 1991 conjecture by \textit{G. Brightwell} and \textit{P. Winkler} [Order 8, No. 3, 225--242 (1991; Zbl 0759.06001)] that counting the number of linear extensions for \textit{posets of height two} is \#\textsf{P}-complete. We further extend this result to \textit{incidence posets of graphs}.
0 references
0 references
0.8716898560523987
0 references
0.8701837658882141
0 references
0.8334101438522339
0 references
0.8315155506134033
0 references
0.8034835457801819
0 references
