Term of Award
Spring 2017
Degree Name
Master of Science in Mathematics (M.S.)
Document Type and Release Option
Thesis (restricted to Georgia Southern)
Copyright Statement / License for Reuse
Digital Commons@Georgia Southern License
Department
Department of Mathematical Sciences
Committee Chair
Colton Magnant
Committee Member 1
Daniel Gray
Committee Member 2
Hua Wang
Abstract
We show the minimum number of vertices necessary of a complete Gallai-colored graph on $k$ colors that forces a monochromatic complete bipartite graph $K_{2,m}$, $K_{3,3}$, and $K_{3,m}$, for $m\geq 3$. We also provide some results on graphs that are free of rainbow triangles with a pendant edge that provide more insight to the structure of Gallai colorings.
Recommended Citation
Gutierrez, Seth, "On Gallai-Ramsey Numbers of Complete Bipartite Graphs" (2017). Electronic Theses and Dissertations. 1547.
https://digitalcommons.georgiasouthern.edu/etd/1547
Research Data and Supplementary Material
No
