Abstract
dc:description.abstractGiven a graph $G$, we consider the problem of finding the minimum number $n$ such that any $k$ edge colored complete graph on $n$ vertices contains either a rainbow colored triangle or a monochromatic copy of the graph $G$, denoted grk(K3:G). More precisely we consider G=Bm,\ell where Bm,\ell is a broom graph with $m$ representing the number of vertices on the handle and $\ell$ representing the number of bristle vertices. We develop a technique to reduce the difficulty of finding grk(K3:Bm,\ell), and use the technique to prove a few cases with a fixed handle length, but arbitrarily many bristles. Further, we find upper and lower bounds for any broom.
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
-
- Hamlin, Benjamin J
- Contributors dc:contributor
-
- Colton Magnant
- Goran Lesaja
- Daniel Gray
Subjects
dc:subject × 1Rights
- Licence dc:rights.license
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.georgiasouthern.edu/etd/1896