Ruzsa-Szemer\'edi Theorem and Relatives (problem 2)
Statement
Let be a graph and be such that ). Then for any there is so that if and a graph is the edge-disjoint union of copies of , then contains another copy of (i.e.\ has at least copies of ).
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.