Optimizing linear extensions

DOI10.1137/090759276MaRDI QIDQ3583317zbMATH OpenOpenAlexFDO

Authors Bridget Eileen Tenner

Publication date 27 August 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.1688

zbMATH Keywords

linear extensionoptimizationposet

Mathematics Subject Classification ID

Total orders (06A05) Combinatorics of partially ordered sets (06A07)

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}.

Recommendations

• Linear extension numbers of \(n\)-element posets
• Antichains and linear extensions
• Posets with seven linear extensions sortable by three comparisons
• scientific article; zbMATH DE number 3877241
• scientific article; zbMATH DE number 2052742

Cited in

(7)

• Optimal choice of linear interval extension
• Linear extension numbers of \(n\)-element posets
• Generating Linear Extensions Fast
• scientific article; zbMATH DE number 1951623 (Why is no real title available?)
• Improving linear processing systems via flexibility
• Linear extensions and continued fractions
• Computational complexity of counting coincidences

This page was built for publication: Optimizing linear extensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583317)