Degree Year
2013
Document Type
Thesis - Open Access
Degree Name
Bachelor of Arts
Department
Mathematics
Advisor(s)
Robert Bosch
Keywords
Ramsey numbers for cycles, Generalized Ramsey numbers, Ramsey theory, Monochromatic cycles, Graph theory, Combinatorics
Abstract
Inspired by an investigation of Ramsey theory, this paper aims to clarify in further detail a number of results regarding the existence of monochromatic cycles in complete graphs whose edges are colored red or blue. The second half focuses on a proof given by Gyula Károlyi and Vera Rosta for the solution of all R(Cn,Ck).
Repository Citation
Djang, Claire, "Two-Coloring Cycles In Complete Graphs" (2013). Honors Papers. 318.
https://digitalcommons.oberlin.edu/honors/318
