Erdős Problem #624
No proof or disproof is known, and it isn't known whether a finite computation could settle it.
What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).
The condition that an integer `m` ensures the existence of a function `f` covering `Fin n` for all large enough subsets `Y`. The property is invariant under bijection, so we use a representative `Fin n` for a finite set of size `n`.
Let \(H(n)\) be the minimum integer \(m\) such that there is a function \(f: \mathcal{P}(X) \to X\) where \(X\) is a finite set of size \(n\), such that for every subset \(Y \subseteq X\) with \(|Y| \ge m\), the set \(\{f(A) : A \subseteq Y\}\) covers \(X\).
Attempts
submit one →Read our working report →
For the unrestricted live statement, proved the threshold reduction \(p(h)/2^h\to0\), supplied directly checked witnesses, and computationally established \(H(n)=0,1,2,3,3,3,4,4,4,4,4\) for \(1\le n\l
PARTIAL