Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 4 (p. 656) of Xuemei Zhang, Yaojun Chen and T.C. Edwin Cheng, Polarity graphs and Ramsey numbers for versus stars, Discrete Math. 340 (2017), no. 4, 655--660: "Let be an odd prime power. Then if and ." These are values of the function of Problem 552, each equal to . The paper recalls Parsons's 1976 family, the same formula for even when is odd, so the new values are those with odd ; its summary records and as new. Its Ramsey graphs for odd add one edge to a subgraph of the polarity graph. The statement is recorded on the result page Theorem 4 of the library home zhang_2017_polarity_graphs_ramsey_numbers_c_4_versus_stars.
Covers. The value of at for every odd prime power and every with , . The value at every other , and the second question, whether for infinitely many , are not settled by it; the paper's Question 1 (p. 656) asks whether every value is or one more.
Depends on. Nothing in this wiki; the theorem rests on the paper's own constructions and lemmas.
Acceptance. Refereed: the paper is a journal publication in Discrete
Mathematics, volume 340, number 4 (April 2017), the refereed evidence;
the issue carries no day, so this page is dated to the first day of that
month. The site's curator refers to this paper in the commentary on exact
values, but the site's label OPEN settles neither the problem nor a
declared part of it, so reviewed is not listed. The statement is checked
against the publisher's text; the proof is read for structure only.