Erdős problem 1023
Let be the maximal size of a family of subsets of such that no set in this family is the union of other members of the family. Is it true that there is a constant such that
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:9d4e204d38def5805ee0a0b4644421ddb37afd1e18fc2e686510fc2799e203fc
- Metadata
- sha256:ff10c06bf1e06f0672f6a9d2c7d20cb51c5fabf5e1f873a3363e67bd54414183
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:ffee7578cfa1ce51aecd22ceeee3dc253faecc706c283451be6459c30a9af10c
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb