Term of Award

Spring 2016

Degree Name

Master of Science in Mathematics (M.S.)

Document Type and Release Option

Thesis (open access)

Department

Department of Mathematical Sciences

Committee Chair

Colton Magnant

Committee Member 1

Zhuojun Magnant

Committee Member 2

Hua Wang

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.

Share

COinS