Skip to content

Erdős problem 701

Let F\mathcal{F} be a family of sets closed under taking subsets (i.e. if B⊆A∈FB\subseteq A\in\mathcal{F} then B∈FB\in \mathcal{F}). There exists some element xx such that whenever F′⊆F\mathcal{F}'\subseteq \mathcal{F} is an intersecting subfamily we have ∣F′∣≤∣{A∈F:x∈A}∣.\lvert \mathcal{F}'\rvert \leq \lvert \{ A\in \mathcal{F} : x\in A\}\rvert.

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:68576448dc950f90f265d0592cf8a3c6519cc7caa5e2f4c15ebedaa4184ff49d
Metadata
sha256:216a040da65f88c7c592c66729c514bef821564e7035f72553fda7e78629bbc0
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:64e0db59cc97c662de9c90c9a80af008973efbdf0029128434928f2735427c84
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb