Term of Award
Master of Science in Mathematics (M.S.)
Document Type and Release Option
Thesis (open access)
Department of Mathematical Sciences
Committee Member 1
Committee Member 2
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.
Gregory, Jonathan, "Gallai-Ramsey Number of An 8-Cycle" (2016). Electronic Theses & Dissertations. 1435.