Erdős Problem #600 — Let e(n,r) be minimal such that every graph on n vertices with at least e(n,r) edges, each edge contained in at least one triangle, must have an edge contained in at least r triangles.
Statement
Let be minimal such that every graph on vertices with at least edges, each edge contained in at least one triangle, must have an edge contained in at least triangles. Let . Is it true that as ? Is it true that as ?
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.