Erdős problem 602 · problems.science

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

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.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:c2192fd4cf9cf253092e6ab0a9fae67f2600e9f78724066b43c287218f82acfc
Metadata: sha256:bf77ce9109bd84507ae1c0ce9171570d95e3f45993c950bd61a47f55931b1d6e
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:aef853a90fd2d2d067a549ba55546146896900f574f7a68b1b298dc1e7b8ca8f

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207