Partially ordered sets
Finite posets as combinatorial objects: Dilworth's and Mirsky's theorems, Erdős–Szekeres monotone subsequences, linear extensions, Möbius algebras and flag vectors, chain polynomials and Neggers' conjecture, Sperner properties of the weak order, rowmotion and toggle homomesy, poset matrices and rooted trees; lattice theory goes to Order.
- Chain polynomials of posets
- Dilworth's theorem
- Erdős–Szekeres theorem
- Linear extensions of posets
- Mirsky's theorem
- Möbius algebras and flag vectors
- Neggers–Stanley conjecture
- Poset matrices and quasi-full rooted trees
- Rowmotion on root posets
- Sperner property of the weak order
- Toggle homomesy for noncrossing partitions
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.