Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

"These results suggest a general question. If TnT_n is any tree with parts of size n/3n/3 and 2n/32n/3 is r(Tn)={4n/3−1}r(T_n)=\{4n/3-1\}?" (printed p. 292, the last sentence of Section II).

The paper writes {x}\{x\} for the least integer ≥x\ge x and [x][x] for the integer part: on p. 286 a broom Bk,ℓB_{k,\ell} has parts of sizes {ℓ/2}\{\ell/2\} and k+[ℓ/2]k+[\ell/2], which sum to k+ℓk+\ell. With n=3kn=3k the parts are kk and 2k2k and the value is 4k−14k-1, the statement of Problem 549. It is posed as a question, after Theorem 2.2 and the remark on p. 288 that the brooms Bk,ℓB_{k,\ell} with 2k≤ℓ≤2k+22k\le\ell\le2k+2 attain r(Bk,ℓ)={4(k+ℓ)/3−1}r(B_{k,\ell})=\{4(k+\ell)/3-1\}, "a specific tree whose Ramsey number is as small as possible".

Source. P. Erdős, R. J. Faudree, C. C. Rousseau and R. H. Schelp, Ramsey numbers for brooms, Congr. Numer. 35 (1982), 283--293; printed p. 292 is PDF p. 10 of the scan, read on the page image (the scan's text layer garbles the braces).

Read depth. Claims checked: the sentence and the notation on pp. 286 and 288 were read on the page images. A question has no proof.

Proof pointer

None; the question is answered in the negative by Norin, Sun and Zhao (2016).

Dependencies

None.

Bears on

  • Problem 549: the origin of the problem, posed as a question rather than a conjecture.