ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Bm(2)B_m^{(2)} denote the book graph consisting of mm triangles sharing a common edge, and let r(Bcn(2),Bn(2))r(B_{cn}^{(2)},B_n^{(2)}) be the smallest integer NN such that every red-blue coloring of the edges of the complete graph KNK_N contains a red copy of Bcn(2)B_{cn}^{(2)} or a blue copy of Bn(2)B_n^{(2)}. The random bound is (c+1)2n+o(n)(\sqrt{c}+1)^2n+o(n). Random-bound conjecture. For every c<1c<1, there exists some β=β(c)>0\beta=\beta(c)>0 such that, for all sufficiently large nn,

r(Bcn(2),Bn(2))≥((c+1)2+β)n.r(B_{cn}^{(2)},B_n^{(2)})\geq\bigl((\sqrt{c}+1)^2+\beta\bigr)n.

Thus, for every fixed c<1c<1, the random bound is not tight. This is part of the open problem of understanding r(Bcn(2),Bn(2))r(B_{cn}^{(2)},B_n^{(2)}) for c∈(1/6,1)c\in(1/6,1) as n→∞n\to\infty; the paper notes that its methods do not determine the threshold c1(2)c_1(2) and suggests that the random bound may never be tight for c<1c<1.

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.