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?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:aef96d8e38310b2df22ccea08e57d2705d5454562b5285e400abae8e8c7981f5
Metadata
sha256:85c8b4e98ebc82c2efdcc59de8d6730142cb38a57eee7d34afbdefc6cb091f96
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:ff1aecb8fbffea2e193d20021d37c3f3de88cbd30f25bf43f6c1f498ba402c11
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON