Fox–Grinshpun–Liebenau–Person–Szabó conjecture on the monotonicity of the minimum degree parameter
Statement
Let denote the minimum degree parameter for -color Ramsey problems with clique target . Fox–Grinshpun–Liebenau–Person–Szabó conjecture. For all and , we have
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.