Erdős Problem #596 — For which graphs G_1,G_2 is it true that - for every n≥ 1 there is a graph H without a G_1 but if the edges of H are n-coloured then there is a monochromatic copy of G_2, and yet - fo…
Statement
For which graphs is it true that
-
for every there is a graph without a but if the edges of are -coloured then there is a monochromatic copy of , and yet
-
for every graph without a there is an -colouring of the edges of without a monochromatic .
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.