ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk and ℓ\ell be integers with k≥ℓ≥2k \geq \ell \geq 2. For graphs GG and positive integers a1,…,ara_1,\dots,a_r, write G→(Ka1,…,Kar)G \rightarrow (K_{a_1},\dots,K_{a_r}) if every rr-colouring of the edges of GG contains a monochromatic copy of KaiK_{a_i} in some colour ii; write G↛(Ka1,…,Kar)G \not\rightarrow (K_{a_1},\dots,K_{a_r}) otherwise.

Generalized asymmetric three-colour Ramsey conjecture. For any integers k≥ℓ≥2k \geq \ell \geq 2, there exists a graph GG such that G↛(Kk,Kk,Kℓ)G \not\rightarrow (K_k,K_k,K_{\ell}), but G→(Kk+1,Kk−1,Kℓ)G \rightarrow (K_{k+1},K_{k-1},K_{\ell}).

This conjecture is presented as a three-colour analogue related to the preceding conjecture in the same way that the preceding two-colour theorem relates to the Nešetřil–Rödl result. Its status is not resolved in the supplied text.

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.