The linear upper-bound conjecture for minimum degrees of minimal Ramsey graphs
Statement
Let denote the minimum degree among all Ramsey -minimal graphs. Let be a connected graph on vertices, and let be its minimum degree.
Linear upper-bound conjecture.
The conjecture gives an upper bound for in terms of the order and minimum degree of , and the source notes that it is tight for both and . Its general validity remains open.
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.