Skip to content

Erdős problem 701

Let F\mathcal{F} be a family of sets closed under taking subsets (i.e. if BAFB\subseteq A\in\mathcal{F} then BFB\in \mathcal{F}). There exists some element xx such that whenever FF\mathcal{F}'\subseteq \mathcal{F} is an intersecting subfamily we have F{AF:xA}.\lvert \mathcal{F}'\rvert \leq \lvert \{ A\in \mathcal{F} : x\in A\}\rvert.

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:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:64e0db59cc97c662de9c90c9a80af008973efbdf0029128434928f2735427c84
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page