ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let sq(Kt)s_q(K_t) denote the minimum degree parameter for qq-color Ramsey problems with clique target KtK_t. Fox–Grinshpun–Liebenau–Person–Szabó conjecture. For all q⩾3q\geqslant 3 and t⩾3t\geqslant 3, we have

sq(Kt)⩾sq(Kt−1).s_q(K_t) \geqslant s_q(K_{t-1}).

This conjecture concerns monotonicity of the minimum degree parameter as the clique size varies. The paper suggests that its asymmetric signal senders and determiners could help prove it.

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.