A structure theorem for posets admitting a ``strong chain partition: a generalization of a conjecture of Daykin and Daykin (with connections to probability correlation inequalities)
From MaRDI portal
Publication:864160
DOI10.1016/j.disc.2005.01.012zbMath1107.06003OpenAlexW2314727778MaRDI QIDQ864160
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.01.012
partitionpartially ordered setchainordinal sumlinear extensionDilworth's theoremcorrelation inequality
Partial orders, general (06A06) Partitions of sets (05A18) Combinatorics of partially ordered sets (06A07)
Cites Work
- Partitions of a finite three-complete poset
- A decomposition theorem for partially ordered sets
- Order Preserving Maps and Linear Extensions of a Finite Poset
- Some Monotonicity Properties of Partial Orders
- Hyperplane arrangements, interval orders, and trees.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item