Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Electronic Theses and Dissertations
Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.