ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For graphs GG and HH, the Ramsey number r(G,H)r(G,H) is the smallest positive integer NN such that every red/blue edge-coloring of the complete graph KNK_N contains either a red GG or a blue HH. A book BnB_n is a graph consisting of nn triangles sharing a common edge. Conlon–Fox–Wigderson's conjecture. For every α<1\alpha<1, the random lower bound for r(Bαn,Bn)r(B_{\alpha n},B_n) is not tight. In other words, there exists some β=β(α)>0\beta=\beta(\alpha)>0 such that

r(Bαn,Bn)≥(α+1)2n+βnr(B_{\alpha n},B_n)\ge (\sqrt{\alpha}+1)^2n+\beta n

for all nn 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 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.