A simple upper bound on the number of antichains in \([t]^n\) (Q2279682): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:34, 5 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
