Conlon–Fox–Wigderson's book Ramsey-number conjecture
Statement
For graphs and , the Ramsey number is the smallest positive integer such that every red/blue edge-coloring of the complete graph contains either a red or a blue . A book is a graph consisting of triangles sharing a common edge. Conlon–Fox–Wigderson's conjecture. For every , the random lower bound for is not tight. In other words, there exists some such that
for all sufficiently large. The conjecture predicts a linear improvement over the random lower bound in the unbalanced book Ramsey problem; its resolution is not established in the supplied source.
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.