A simple upper bound on the number of antichains in \([t]^n\) (Q2279682): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:53, 2 February 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
