ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For which graphs G1,G2G_1,G_2 is it true that

  • for every n≥1n\geq 1 there is a graph HH without a G1G_1 but if the edges of HH are nn-coloured then there is a monochromatic copy of G2G_2, and yet

  • for every graph HH without a G1G_1 there is an ℵ0\aleph_0-colouring of the edges of HH without a monochromatic G2G_2.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.