Erdős Problem #500 — What is ex_3(n,K_4^3)?
Statement
What is ? That is, the largest number of -edges which can placed on vertices so that there exists no , a set of 4 vertices which is covered by all 4 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.