Skip to content

Erdős problem 497

Start work

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

Erdős Problems records this as solved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionsolved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Open the work surface
Where the source files it46 share a topic
Combinatorics47
None carries a Standing. Browse the topic.
Start workOpen sources