New Diagonal Graph Ramsey Numbers of Unicyclic Graphs
oleh: Richard M. Low, Ardak Kapbasov
| Format: | Article |
|---|---|
| Diterbitkan: | Georgia Southern University 2023-01-01 |
Deskripsi
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.