Publication Date
1-1-2023
Document Type
Article
Publication Title
Theory and Applications of Graphs
Volume
10
Issue
1
DOI
10.20429/tag.2023.10109
Abstract
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.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Department
Mathematics and Statistics
Recommended Citation
Richard M. Low and Ardak Kapbasov. "New Diagonal Graph Ramsey Numbers of Unicyclic Graphs" Theory and Applications of Graphs (2023). https://doi.org/10.20429/tag.2023.10109
COinS
