Back to search

Georgia Southern University

Gallai-Ramsey Number for Classes of Brooms

Abstract

dc:description.abstract

Given 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 × 1

Rights

Identifiers

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

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

Hamlin, Benjamin J. Gallai-Ramsey Number for Classes of Brooms. Thesis (open access) thesis, https://digitalcommons.georgiasouthern.edu/etd/1896