Determine, for any $k > r > 2$ , the value of $\frac{ex _{r} ( n , K _{k}^{r} )}{( r n )},$ where $ex_{r} (n, K_{k}^{r})$ is the largest number of $r$ -edges which can placed on $n$ vertices so that there exists no set of $k$ vertices which is covered by all $(r k)$ possible $r$ -edges.

Worked, still open.

graph theory · open · prize $500 · possible · 0 attempts

use this record

vela registry pull vfr_37aec80d874a0239

vela reproduce examples/erdos-problems

evidence

unverified AI candidates (2)

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

[ f_{r,k}(n):=\frac{\mathrm{ex}_r(n,K_k^r)}{\binom nr}, ]

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.

open