Back to search

Georgia Southern University

Gallai-Ramsey Number of An 8-Cycle

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Mathematics (M.S.)
Level thesis:degree_level
Thesis (open access)
Discipline thesis:degree_discipline
Department of Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gregory, Jonathan
Contributors dc:contributor
  • Zhuojun Magnant
  • Hua Wang

Subjects

dc:subject × 4

Rights

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.georgiasouthern.edu/etd/1435

Chain of custody

source
Harvested from
Georgia Southern University
Base URL
digitalcommons.georgiasouthern.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Gregory, Jonathan. Gallai-Ramsey Number of An 8-Cycle. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/1435