Skip to content

Erdős problem 602

Start work

Does every almost-disjoint family of countably infinite sets whose pairwise intersections all have size ≠ 1 have Property B?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded 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:c2192fd4cf9cf253092e6ab0a9fae67f2600e9f78724066b43c287218f82acfc
Metadata
sha256:bf77ce9109bd84507ae1c0ce9171570d95e3f45993c950bd61a47f55931b1d6e
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:aef853a90fd2d2d067a549ba55546146896900f574f7a68b1b298dc1e7b8ca8f
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON