Abstract
dc:description.abstract<p>The Ramsey number $R(r, b)$ is the least positive integer such that every edge 2-coloring of the complete graph KR(r, b) with colors red and blue either embeds a red Kr or a blue Kb. We explore various methods to find lower bounds on $R(r,b)$, finding new results on fibrations and semicirculant graphs. Then, generalizing the Ramsey number to graphs other than complete graphs, we flesh out the missing details in the literature on a theorem that completely determines the generalized Ramsey number for cycles.</p>
Degree
thesis:*- Name thesis:degree_name
- MS in Mathematics
- Discipline thesis:degree_discipline
- Mathematics
- Year dc:date.available
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Lai, David
- Contributors dc:contributor
-
- Anthony Mendes
- Mathematics
- College of Science and Mathematics
Subjects
dc:subject × 3Identifiers
dc:identifier.*- Identifier
- 10.15368/theses.2022.41
- OAI identifier oai:identifier
- oai:digitalcommons.calpoly.edu:theses-4050