A recurrence for linear extensions

DOI10.1007/BF00341632zbMath0692.06001MaRDI QIDQ583247

Takayuki Hibi, Richard P. Stanley, Paul H. Edelman

Publication date: 1989

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

comparability graphsnumber of linear extensions of a finite partially ordered setsaturated chains

Mathematics Subject Classification ID

Partial orders, general (06A06) Total orders (06A05)

Related Items

Upper Bounds on Mixing Time of Finite Markov Chains, Kernels of minimum size gossip schemes, Linear extension numbers of \(n\)-element posets, Approximating the number of linear extensions, Effective Poset Inequalities, Mixing time for Markov chain on linear extensions, Markov Chains for Promotion Operators, FINITELY DEPENDENT COLORING, Inequalities for the number of linear extensions, Combinatorial Markov chains on linear extensions, A broad class of shellable lattices, Bottom-up: a new algorithm to generate random linear extensions of a poset, Linear extensions and comparable pairs in partial orders, The bounds for the number of linear extensions via chain and antichain coverings

Cites Work

• Unnamed Item
• Comparability invariance of the fixed point property
• Two poset polytopes
• Promotion des morphismes d'ensembles ordonnes
• Invariants of finite comparability graphs