We prove the 1991 conjecture by Brightwell and Winkler that counting the number of linear extensions for posets of height two is #P-complete. We further extend this result to incidence posets of graphs.
@article{10_37236_8552,
author = {Sam Dittmer and Igor Pak},
title = {Counting linear extensions of restricted posets},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {4},
doi = {10.37236/8552},
zbl = {1484.06011},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8552/}
}
TY - JOUR
AU - Sam Dittmer
AU - Igor Pak
TI - Counting linear extensions of restricted posets
JO - The electronic journal of combinatorics
PY - 2020
VL - 27
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/8552/
DO - 10.37236/8552
ID - 10_37236_8552
ER -
%0 Journal Article
%A Sam Dittmer
%A Igor Pak
%T Counting linear extensions of restricted posets
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/8552/
%R 10.37236/8552
%F 10_37236_8552
Sam Dittmer; Igor Pak. Counting linear extensions of restricted posets. The electronic journal of combinatorics, Tome 27 (2020) no. 4. doi: 10.37236/8552
