Erdős Problem #712 — Determine, for any k>r>2, the value of fracex_r(n,K_k^r)binomnr, where ex_r(n,K_k^r) is the largest number of r-edges which can placed on n vertices so that the…
Statement
Determine, for any , the value of where is the largest number of -edges which can placed on vertices so that there exists no set of vertices which is covered by all possible -edges.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.