Skip to content

Erdős problem 624

Let XX be a finite set of size nn and H(n)H(n) be such that there is a function f:{A:AX}Xf:\{A : A\subseteq X\}\to X so that for every YXY\subseteq X with YH(n)\lvert Y\rvert \geq H(n) we have {f(A):AY}=X\left\{ f(A) : A\subseteq Y\right\}=X. Prove that H(n)log2nH(n)-\log_2 n \to \infty.

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:b4bf394f60d5aa696bb07e09e9d38470916ac0c0593651f2d3ae6c07eed3cae8
Metadata
sha256:44d4def37cff0f31fa413394925513fb0a7e9311d7be76ce028d18a1a9586b05
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:bc4011952b2ea84d4ac27ce47b1562ee26bb77f811814ffcd6be7087ce7e1450
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page