The following pages link to A recurrence for linear extensions (Q583247):
Displaying 14 items.
- A broad class of shellable lattices (Q529232) (← links)
- Inequalities for the number of linear extensions (Q1198479) (← links)
- Approximating the number of linear extensions (Q1392204) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- The bounds for the number of linear extensions via chain and antichain coverings (Q2035097) (← links)
- Combinatorial Markov chains on linear extensions (Q2248568) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Linear extension numbers of \(n\)-element posets (Q2663168) (← links)
- Mixing time for Markov chain on linear extensions (Q2680908) (← links)
- FINITELY DEPENDENT COLORING (Q2971028) (← links)
- Upper Bounds on Mixing Time of Finite Markov Chains (Q5055645) (← links)
- Markov Chains for Promotion Operators (Q5112365) (← links)
- Effective Poset Inequalities (Q6046818) (← links)
