Grossman conjectured that R(G, G) = 2 ⋅ |V(G)| - 1, for all simple connected unicyclic graphs G of odd girth and |V(G)| ≥ 4. In this note, we prove his conjecture for various classes of G containing a triangle. In addition, new diagonal graph Ramsey numbers are calculated for some classes of simple connected unicyclic graphs of even girth.
No takes yet. Share an insight, caveat, or question.
Low et al. (2023) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: