Optimizing Linear Extensions
Combinatorics
2009-07-28 v2
Abstract
The minimum number of elements needed for a poset to have exactly n linear extensions is at most 2sqrt{n}. In a special case, the bound can be improved to sqrt{n}.
Cite
@article{arxiv.0905.1688,
title = {Optimizing Linear Extensions},
author = {Bridget Eileen Tenner},
journal= {arXiv preprint arXiv:0905.1688},
year = {2009}
}
Comments
Final version, to appear in SIAM J Discrete Math