Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Dubo 2024 ramsey number double star
corollary_3: The elementary upper bound on the Ramsey number of the double star with 2m and m leaves, the special case of the paper's Theorem 2.
theorem_2: The paper's main result, an explicit upper bound on the two-color Ramsey number of the double star S(m1,m2) for all positive integers m1, m2 with (sqrt5+1)/2 m2 < m1 < 3m2.
F. Flores Dubó and M. Stein, On the Ramsey number of the double star, Discrete Math. 348 (2025), no. 1, article 114227; DOI 10.1016/j.disc.2024.114227; arXiv:2401.01274.
The copy read for this card is the arXiv preprint 2401.01274v2 (20 April 2024; v1 is of 2 January 2024), seven pages numbered 1--7; the published version was not compared, so the locators below are preprint pages. Source: https://arxiv.org/abs/2401.01274. The arXiv record names arXiv's non-exclusive distribution license (arXiv:2401.01274), every other right reserved.
Read status: claims checked for Theorem 2, Corollary 3 and Lemma 4 (read clause by clause on the page image of p. 3); the proof of Theorem 2 (pp. 4--6) was read for structure; the introduction was read on the page images of pp. 1--3.
Contents
- Introduction (pp. 1--3): is the double star with leaves in class ; is the lower bound from the canonical colorings for a tree with bipartition classes ; Burr's belief that unless is an odd star, confirmed asymptotically by Haxell, Łuczak and Tingley, who show for trees with and , where and depend on ; Grossman, Harary and Klawe's double stars with and their conjecture for double stars, known for [5] and for [8], that is, inequality (1) outside the range (2); Norin, Sun and Zhao's lower bounds, which give while , and their Question 1 (is ?); the remark (p. 3) that Theorem 4.5 of [8] with the fifth invalid pair of its table gives .
- Theorem 2 (p. 3): for with , . Corollary 3: for all (the abstract rounds the constant to ).
- Section 2 (pp. 3--4): Lemma 4 (an edge with , and spans an ), Lemma 5 (degree counting in a graph without ), Lemma 6 (Lemma 2.3 of [8]: for and a two-coloring of with no monochromatic , one color has all degrees at most ).
- Section 3 (pp. 4--6): the proof of Theorem 2 on vertices with ; the acknowledgment records a missing ceiling corrected from an earlier version.
Compiled scope
Pages 1--7 were read on the page images. No proof was checked beyond structure and nothing here is independently reviewed.
Bears on. #549: Corollary 3 is the site's elementary upper bound; Theorem 2 covers the problem's tree for and gives , the same constant asymptotically (a specialization made on the Theorem 2 page, not in the paper), an upper bound that neither proves nor refutes the problem's equality; the introduction restates the disproof and the bound and quotes Question 1 of Norin, Sun and Zhao. The paper does not concern the Burr--Erdős conjecture beyond recalling it.
No file of this source is held: no license on record permits its redistribution, and the card cites the edition it names above.