A simple upper bound on the number of antichains in \([t]^n\) (Q2279682): 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.1007/s11083-018-9480-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2903418269 / rank | |||
Normal rank |
Revision as of 20:06, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simple upper bound on the number of antichains in \([t]^n\) |
scientific article |
Statements
A simple upper bound on the number of antichains in \([t]^n\) (English)
0 references
13 December 2019
0 references
partially ordered set
0 references
Dedekind's problem
0 references
monotonic Boolean function
0 references