Erdős problem 497 · problems.science

How many antichains in $[n]$ are there? That is, how many families of subsets of $[n]$ are there such that, if $\mathcal{F}$ is such a family and $A,B\in \mathcal{F}$ , then $A\not\subseteq B$ ?

Retained from Formal Conjectures · not edited here

Formal statements: 1 solved
Erdős Problems says: solved (Lean)
Decision here: No current contribution
Checks: 0 checks · 1 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type: —
Evidence: 0 artifacts
Decision: None
Reviewed: No date retained

No result has been accepted here yet.

Search problems.science