Counting Linear Extensions of Restricted Posets
Abstract
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.