Diagonal Graph Ramsey Numbers of Even Cycles With Pendant Edges

Authors

Richard M. Low, San Jose State UniversityFollow
Ardak Kapbasov, San Jose State University

Publication Date

1-1-2026

Document Type

Article

Publication Title

Australasian Journal of Combinatorics

Volume

94

First Page

221

Last Page

234

Abstract

Let G be a simple graph. The diagonal graph Ramsey number R(G, G) is defined to be the minimum n, where every 2-coloring of the edges of Kn contains a red G or a blue G. In this paper, new diagonal graph Ramsey numbers are calculated for some classes of even cycles with pendant edges.

Department

Mathematics and Statistics

Recommended Citation

Richard M. Low and Ardak Kapbasov. "Diagonal Graph Ramsey Numbers of Even Cycles With Pendant Edges" Australasian Journal of Combinatorics (2026): 221-234.