Erdős Problem #1095 — Let $g(k)>k+1$ be the smallest $n$ such that all prime factors of $\binom{n}{k}$ are $>k$.

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.