Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
The double star is the tree formed by joining the centers of a star with leaves and a star with leaves (abstract, p. 1); its bipartition classes have sizes and . is the smallest such that every two-coloring of the edges of contains a monochromatic copy of (p. 1).
Theorem 2 (p. 3). For all with ,
Both inequalities in the hypothesis are strict, and the bound is stated for every pair in the range, with no asymptotic error term.
Context in the paper (pp. 2--3). Grossman, Harary and Klawe conjectured for all double stars; the paper records this as known for and for , that is, outside the range (its (2)), and it recalls that the lower bounds of Norin, Sun and Zhao give for . Since , the paper observes that Theorem 2 covers the whole range (2). The acknowledgment (p. 6) records that a missing ceiling in the bound of Theorem 2 was pointed out in an earlier version of the paper; the statement above is that of v2.
Source. F. Flores Dubó and M. Stein, On the Ramsey number of the double star, arXiv:2401.01274v2 (20 April 2024), Theorem 2 on p. 3, the context on pp. 2--3, the acknowledgment on p. 6. Published as Discrete Math. 348 (2025), no. 1, article 114227, doi:10.1016/j.disc.2024.114227; the published version was not compared. The edition read is identified on the source card.
Read depth. Claims checked: the statement and its hypotheses were read clause by clause on the page image of p. 3. The proof (Section 3, pp. 4--6) was read for structure and not checked step by step. Nothing here is independently reviewed.
Proof pointer
Section 3 (pp. 4--6), elementary, by contradiction. Put (their (4)), so that (their (5)), and take , which is the bound of the theorem. In a two-coloring of with no monochromatic , Lemma 6 (Lemma 2.3 of Norin, Sun and Zhao, which needs , supplied by (5)) gives a color, say blue, in which every degree is at most , so the red graph has minimum degree at least . Fix a vertex and of its red neighbours . Lemma 5 bounds the red neighbours of each outside , and applied again it finds a vertex with few red neighbours in , hence many outside . The blue degree bound forces a red edge with , and the two estimates give , using , which follows from the definition of . Lemma 4 then gives a red with central edge .
Dependencies
Same paper: Lemma 4 (p. 3: an edge with , and spans an ) and Lemma 5 (p. 4: a degree count in a graph on at least vertices with no ). External: Lemma 2.3 of S. Norin, Y. R. Sun and Y. Zhao, Asymptotics of Ramsey numbers of double stars, arXiv:1605.03612, quoted as Lemma 6 (p. 4). Consequence: Corollary 3, the case , .
Bears on
- Problem 549: the problem asks whether for every tree with bipartition classes of sizes and . Its double star satisfies the hypothesis of Theorem 2 exactly when (the condition ), and for those Theorem 2 gives , with (a specialization made here, not in the paper). This is an upper bound only; it neither proves nor refutes the problem's equality, and the paper does not apply it to .