The following pages link to A recurrence for linear extensions (Q583247):
Displaying 34 items.
- A broad class of shellable lattices (Q529232) (← links)
- On log concavity for order-preserving maps of partial orders (Q795043) (← links)
- Counting linear extension majority cycles in partially ordered sets on up to 13 elements (Q980203) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- The number of linear extensions of bipartite graphs (Q1114718) (← links)
- Linear extensions and order polynomials of finite partially ordered sets (Q1120603) (← links)
- Balancing extensions via Brunn-Minkowski (Q1181013) (← links)
- Inequalities for the number of linear extensions (Q1198479) (← links)
- The number of partially ordered sets with more points than incomparable pairs (Q1199473) (← links)
- Antichains and linear extensions (Q1300333) (← links)
- Geometrical techniques for estimating numbers of linear extensions (Q1304428) (← links)
- Order series of labelled posets (Q1318362) (← links)
- On a long cycle in the graph of all linear extensions of a poset consisting of two disjoint chains (Q1331990) (← links)
- Approximating the number of linear extensions (Q1392204) (← links)
- Linear extensions of ranked posets, enumerated by descents. A problem of Stanley from the 1981 Banff conference on ordered sets (Q1775739) (← 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 extensions and order-preserving poset partitions (Q2341250) (← links)
- The principal numbers of K. Saito for the types \(A_{l}, D_{l}\) and \(E_{l}\) (Q2455588) (← links)
- Linear recursion congruences with periodic coefficients (Q2536667) (← 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)
- (Q3216720) (← links)
- Linear recurrences in the degree sequences of monomial mappings (Q3623575) (← links)
- (Q3840459) (← links)
- (Q4454615) (← links)
- Upper Bounds on Mixing Time of Finite Markov Chains (Q5055645) (← links)
- Markov Chains for Promotion Operators (Q5112365) (← links)
- Effective Poset Inequalities (Q6046818) (← links)
- Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy (Q6642430) (← links)
