The following pages link to (Q3205287):
Displaying 15 items.
- Chain lengths in the dominance lattice (Q390293) (← links)
- ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible (Q1069961) (← links)
- Some sequences associated with combinatorial structures (Q1073032) (← links)
- Critical graphs for chromatic difference sequences (Q1144038) (← links)
- A solution of the Sperner-Erdős problem (Q1171500) (← links)
- A characteristic property of labelings and linear extensions of posets of dimension 2 (Q1276391) (← links)
- Tableau algorithms defined naturally for pictures (Q1924375) (← links)
- The bounds for the number of linear extensions via chain and antichain coverings (Q2035097) (← links)
- 4-connected triangulations on few lines (Q2206872) (← links)
- Semistandard tableaux associated with generalized labellings of posets (Q2371073) (← links)
- Asymptotics of the Jordan normal form of a random nilpotent matrix (Q2406890) (← links)
- The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm (Q3708805) (← links)
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices (Q3963037) (← links)
- Finite posets and Ferrers shapes (Q5937633) (← links)
- Research problems (Q5970608) (← links)