The off-diagonal book Ramsey random-bound conjecture for two books
Statement
Let denote the book graph consisting of triangles sharing a common edge, and let be the smallest integer such that every red-blue coloring of the edges of the complete graph contains a red copy of or a blue copy of . The random bound is . Random-bound conjecture. For every , there exists some such that, for all sufficiently large ,
Thus, for every fixed , the random bound is not tight. This is part of the open problem of understanding for as ; the paper notes that its methods do not determine the threshold and suggests that the random bound may never be tight for .
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.