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 is any tree with parts of size and is ?" (printed p. 292, the last sentence of Section II).
The paper writes for the least integer and for the integer part: on p. 286 a broom has parts of sizes and , which sum to . With the parts are and and the value is , the statement of Problem 549. It is posed as a question, after Theorem 2.2 and the remark on p. 288 that the brooms with attain , "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.