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) (Q864160): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.01.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2314727778 / rank | |||
Normal rank | |||
Revision as of 00:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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) |
scientific article |
Statements
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) (English)
0 references
13 February 2007
0 references
partially ordered set
0 references
correlation inequality
0 references
linear extension
0 references
Dilworth's theorem
0 references
ordinal sum
0 references
partition
0 references
chain
0 references
