Erdős Problem #1015 — Almost-perfect monochromatic clique packings
Statement
For , let be the least integer such that every red-blue colouring of the edges of every sufficiently large contains at least vertex-disjoint monochromatic copies of , not necessarily all of the same colour. Determine the growth of . In particular, does , and is ?
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.