Optimizing Linear Extensions

@article{Tenner2009OptimizingLE,
  title={Optimizing Linear Extensions},
  author={Bridget Eileen Tenner},
  journal={SIAM J. Discret. Math.},
  year={2009},
  volume={23},
  pages={1450-1454}
}
  • Bridget Eileen Tenner
  • Published 2009
  • Computer Science, Mathematics
  • SIAM J. Discret. Math.
  • The minimum number of elements needed for a poset to have exactly $n$ linear extensions is at most $2\sqrt{n}$. In a special case, the bound can be improved to $\sqrt{n}$. 
    1 Citations

    Figures, Tables, and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    References

    SHOWING 1-7 OF 7 REFERENCES
    Obtainable sizes of topologies on finite sets
    • 8
    • PDF
    What Is Enumerative Combinatorics
    • 3,349
    Combinatorics and Partially Ordered Sets: Dimension Theory
    • 541
    • PDF
    The On-Line Encyclopedia of Integer Sequences
    • N. Sloane
    • Mathematics, Computer Science
    • Electron. J. Comb.
    • 1994
    • 4,918
    • PDF
    Enumerative combinatorics
    • 3,339
    Cambridge Studies in Advanced Mathematics
    • Cambridge Studies in Advanced Mathematics
    • 1997
    Obtainable sizes of finite topologies
    • Obtainable sizes of finite topologies